A posteriori error analysis of stabilised FEM for degenerate convex minimisation problems under weak regularity assumptions

Wolfgang Boiger; Carsten Carstensen

doi:10.1186/2213-7467-1-5

Research article
Open Access
Published: 29 January 2014

A posteriori error analysis of stabilised FEM for degenerate convex minimisation problems under weak regularity assumptions

Wolfgang Boiger^1,2 &
Carsten Carstensen^1,2

Advanced Modeling and Simulation in Engineering Sciences volume 1, Article number: 5 (2014) Cite this article

6689 Accesses
1 Citations
2 Altmetric
Metrics details

Abstract

Background

The discretisation of degenerate convex minimisation problems experiences numerical difficulties with a singular or nearly singular Hessian matrix.

Methods

Some discrete analog of the surface energy in microstrucures is added to the energy functional to define a stabilisation technique.

Results

This paper proves (a) strong convergence of the stress even without any smoothness assumption for a class of stabilised degenerate convex minimisation problems. Given the limitted a priori error control in those cases, the sharp a posteriori error control is of even higher relevance. This paper derives (b) guaranteed a posteriori error control via some equilibration technique which does not rely on the strict Galerkin orthogonality of the unperturbed problem. In the presence of L² control in the original minimisation problem, some realistic model scenario with piecewise smooth exact solution allows for strong convergence of the gradients plus refined a posteriori error estimates. This paper presents (c) an improved a posteriori error control in this interface problem and so narrows the efficiency reliability gap.

Conclusions

Numerical experiments illustrate the theoretical convergence rates for uniform and adaptive mesh-refinements and the improved a posteriori error control for four benchmark examples in the computational microstructures.

Background

Infimising sequences of variational problems with non-quasiconvex energy densities, in general, develop finer and finer oscillations with no classical limit in Sobolev function spaces called microstructure [1–6]. Those oscillations cause difficulty to numerical methods because fine grids are necessary to resolve such oscillations which results in ineffective and tricky mesh-depending computations. Strong convergence of gradients of infimising sequences of the non-quasiconvex problem is impossible.

Relaxation techniques replace the nonconvex energy density by its (semi-)convex hull and lead to a macroscopic model. Since the convexified energy density obtained by this method, in general, lacks strict convexity, numerical algorithms might encounter situations where the Hessian matrix is singular. For instance, the Newton minimisation algorithm fails on the convexified three-well problem of Subsection ‘Three-well benchmark’ below. Applications of relaxation techniques include models in computational microstructure [5–7], some optimal design problems [8, 9], the nonlinear Laplacian [10] (where the Hessian can become arbitrarily ill-conditioned in spite of its strict convexity) and elastoplasticity [1].

Stabilisation techniques regularise the energy term by an additional positive semidefinite stabilisation function. The paper [11] discusses several choices of such stabilisation functions for P₁ conforming finite elements and quasiuniform meshes. It turns out that stabilisation can ensure strong convergence of the strain approximations under particular circumstances. A particular stabilisation in [12] leads to strong convergence even on unstructured grids but is still restricted to unrealistically smooth solutions. This paper studies the stabilisation technique of [12] and addresses the question of convergence (i) without extra regularity assumptions, (ii) in a realistic scenario called model interface problem, and (iii) establishes an a posteriori error control.

The stabilisation leads to improved condition numbers of the Hessian matrix and to reduced errors if the numerical solvers fail without stabilisation. Figure 1 shows the convergence of the discrete stress σ_ℓ of the three-well benchmark corresponding to the discrete minimisers of the energy $E ℓ (v ℓ) = E (v ℓ) + C / 2 ∥ | v ℓ ∥ | ℓ 2$ . The errors are plotted for computations with uniform mesh refinements with various solver tolerances in the discrete minimisation procedure at a fixed triangulation and values of C, cf. Section ‘Numerical experiments’ for details on the MATLAB implementation. Without stabilisation, the convergence stagnates with a moderate tolerance of 10^-5 which becomes visible as a “plateau” in Figure 1. The Newton solver even aborts prematurely due to the singular Hessian. In conclusion, stabilisation enables higher accuracies in numerical examples.

For $β ≥ 0$ the convex energy functional assumes the form

E (v) : = ∫ Ω W (D v (x)) + β | v (x) - g (x) | 2 - f (x) · v (x) d x .

(1.1)

Assume that W is convex with quadratic growth so that there exist minimisers $u ∈ H 01 (Ω)$ ; below p-th order growth is included while p = 2 throughout this simplifying introduction. Given a sequence of shape-regular triangulations $(T ℓ) ℓ ∈ N 0$ [13], let u_ℓ minimise the stabilised discrete energy

E ℓ (v ℓ) : = E (v ℓ) + 12 ∥ | v ℓ ∥ | ℓ 2 with ∥ | v ℓ ∥ | ℓ 2 : = H ℓ 2 ∑ F ∈ F ℓ (Ω) h F - 1 || D v ℓ F || L 2 (F) 2

amongst all conforming P₁ finite element functions v_ℓ on $T ℓ$ , where [Dv_ℓ]_F is the jump of the gradient Dv_ℓ along the interior side F, written $F ∈ F ℓ (Ω)$ , and H_ℓ := maxT h_T is the maximal diameter h_T of all simplices $T ∈ T ℓ$ .

Section ‘Global convergence’ verifies the strong convergence of the discrete solution u_ℓ and its stress σ_ℓ := DW(Du_ℓ) to their respective continuous conterparts,

|| σ - σ ℓ | | L 2 (Ω) 2 + β || u - u ℓ | | L 2 (Ω) 2 + ∥ | u ℓ ∥ | ℓ 2 → 0 as ℓ → ∞.

Section ‘A posteriori error estimates’ presents a novel application of [14–17] to nonlinear problems. For the L² projection Π_ℓ onto the space of piecewise P₀ functions, any Raviart-Thomas function $τ ℓ ∈ RT 0 (T ℓ)$ satisfies

|| σ - σ ℓ | | L 2 (Ω) 2 ≲ || σ ℓ - τ ℓ || L 2 (Ω) + || Π ℓ Λ ℓ + div τ ℓ || L 2 (Ω) + osc ℓ, 2 (Λ ℓ) || u - u ℓ || H 1 (Ω) .

This error bound holds for any discrete displacement u_ℓ that satisfies the boundary conditions; the point is that inexact solve is included — there is no Galerkin orthogonality required. The drawback is to minimise the expression on the right-hand side with respect to τ_ℓ in order to obtain a sharp error bound. This is a particular selection: degenerate convex minimisation problems do not allow for a control of $|| u - u ℓ | | H 1 (Ω)$ and may even face multiple exact or discrete solutions while the discrete minimum of E_ℓ is unique. However, in some results of this paper, either W or the lower-order terms lead to some control over $|| u - u ℓ | | H 2 (Ω)$ and the selection via stabilisation is correct.

Phase transition problems motivate the investigation of scenarios with a smooth solution u up to a one-dimensional interface $Γ ⊂ Ω ¯$ [18]. Section ‘Refined analysis for an interface model problem’ proves that such problems allow even for strong convergence of the gradients for any unique solution u in W^1,∞(Ω)∩H²(Ω∖Γ) [19]. This result also leads to an improvement of the a posteriori error control of the discrete stresses and narrows the efficiency-reliability gap; the efficiency-reliability gap is the difference of the convergence rates of the guaranteed upper a posteriori error bound and the guaranteed lower a posteriori error bound.

Section ‘Numerical experiments’ complements the theoretical findings with numerical experiments to provide empirical evidence of the improved error control. The stabilisation technique competes in four benchmark examples, with and without known exact solution, for uniform and two different mesh-refining algorithms for the explicit residual-based error estimator of [7] and with an averaging-type error estimator of ([18], (1.11)).

Standard notation on Lebesgue and Sobolev spaces is employed throughout this paper and a ≲ b abbreviates a ≤ C b with some generic constant 0 < C < ∞ independent of crucial parameters (like the mesh-size on level ℓ); a ≈ b means a ≲ b ≲ a. Furthermore, A:B abbreviates the matrix inner product that corresponds to the Frobenius norm.

Methods: Discretisation and Stabilisation

Based on the convergence results for unstructured grids, this paper will develop reliable error estimators for a class of stabilised convex minimisation problems described in the sequel. Let $Ω ⊂ R n$ be a bounded Lipshitz domain with polygonal boundary for n = 2 or 3. Given a continuous convex energy density $W : R m × n → R$ , $g, f ∈ L 2 (Ω; R m)$ , $β ≥ 0$ , and $v ∈ W 1, p (Ω; R m)$ with 2 ≤ p < ∞ and m = 1, …, n, the energy is given by (1.1).

Throughout this paper, the energy density $W ∈ C 1 (R m × n; R)$ satisfies (2.1)–(2.2) for parameters 1 < r ≤ 2, 0 ≤ s < ∞ and s + r + p ≤ r p. The two-sided growth condition reads

| F | p - 1 ≲ W (F) ≲ | F | p + 1 for all F ∈ R m × n .

(2.1)

The convexity control assumption reads, for all $F 1, F 2 ∈ R m × n$ ,

| D W (F 1) - D W (F 2) | r ≲ 1 + | F 1 | s + | F 2 | s D W (F 1) - D W (F 2) : F 1 - F 2 .

(2.2)

The proof of Theorem 2 in [7] shows that (2.2) is crucial for the uniqueness of the stress tensor DW(Du).

Given Dirichlet data $u D ∈ W 2, p (Ω; R m) ∩ H 2 (∂Ω; R m)$ for the set of admissible functions $A : = u D + V : = u D + W 0 1, p (Ω; R m)$ , the continuous (convex) model problem reads

minimise E (v) within v ∈ A .

(2.3)

A finite element approximation of (2.3) is based on a family of regular triangulations $(T ℓ) ℓ ∈ N 0$ of the domain Ω into simplices in the sense of Ciarlet [13] (e.g., for n = 2, two non-disjoint triangles of $T ℓ$ share either a common edge or a common node). The set of sides $F ℓ$ consists of edges (for n = 2) or faces (for n = 3) of $T ℓ$ and is split into the union of the sets of all interiour sides $F ℓ (Ω)$ and of all boundary sides $F ℓ (∂Ω)$ .

For latter reference, define the diameter h_T:=diamT of a triangle (or tetrahedron) $T ∈ T ℓ$ and the size h_F := diamF of a side $F ∈ F ℓ$ . The mesh size function $h ℓ : Ω → R > 0$ is given by

h ℓ (x) : = h T for x ∈ int T ∈ T ℓ, min h F : F ∈ F ℓ and x ∈ F otherwise.

The global mesh size will be abbreviated by $H ℓ : = ∥ h ℓ ∥ L ∞ (Ω)$ . We presume the family $(T ℓ) ℓ ∈ N 0$ to be shape-regular so that h_F ≈ h_T for all $T ∈ T ℓ$ , $F ∈ F ℓ$ and F ⊂ T.

The space of $T ℓ$ -piecewise polynomials of degree $≤ k ∈ N 0$ is $P k (T ℓ)$ . The nodal interpolation $I ℓ w ∈ P 1 (T ℓ) ∩ C (Ω ¯)$ of $w ∈ C (Ω ¯)$ is given by I_ℓw(z) = w(z) for all nodes z. Let furthermore Π_ℓw be the L² projection of w ∈ L²(Ω) onto $P 0 (T ℓ)$ , and $osc ℓ, q (w) : = ∥ h ℓ (id - Π ℓ) w ∥ L q (Ω)$ be the oscillation of w ∈ L^q(Ω) for 2 ≤ q ≤ ∞ with respect to the triangulation $T ℓ$ . The symbol id denotes the identity operator. Let u_D,ℓ = I_ℓu_D, and

A ℓ : = u D, ℓ + V ℓ with V ℓ : = V ∩ P 1 (T ℓ; R m) ∩ C (Ω ¯) .

Given a function v on Ω which is possibly discontinuous along some side $F ∈ F ℓ (Ω)$ shared by the two elements T_± such that there exist traces from either sides, the jump of v along F reads

[v] (x) = [v] F (x) : = lim T + ∋ y → x v (y) - lim T - ∋ y → x v (y) for x ∈ F .

The stabilisation of [12] will be used throughout this paper with -1 < γ < ∞ and

a ℓ (v, w) : = ∑ F ∈ F ℓ (Ω) H ℓ 1 + γ h F ∫ F [D v] F : [D w] F d s and ∥ | v ∥ | ℓ 2 : = a ℓ (v, v) .

(2.4)

The stabilised discrete problem reads

minimise E ℓ (v) : = E (v) + 12 a ℓ (v, v) amongst v ∈ A ℓ .

(2.5)

Convergence of gradients with a guaranteed convergence rate is shown in [12] under unrealistically high regularity assumptions. A comprehensive collection of the results in [12] is summarised in the following theorem.

Theorem 2.1.

([12]) Let $u ∈ A ∩ H 3 / 2 + ε (Ω; R m)$ be some solution of (2.3) for some ε > 0; let p^′and r^′be the Hölder conjugate of p and r, -1 < γ < 3, and set

ζ : = min 1 + γ, r ′ for β > 0 and ζ : = min 1 + γ, 2 for β = 0 .

Then the discrete solution $u ℓ ∈ A ℓ$ of (2.5) and the continuous and discrete stress $σ : = D W (D u) ∈ L p ′ (Ω; R m × n)$ and $σ ℓ : = D W (D u ℓ) ∈ P 0 (T ℓ; R m × n)$ satisfy

∥ σ - σ ℓ ∥ L p ′ (Ω) r + ∥ u - u ℓ ∥ L 2 (Ω) 2 + | | | u ℓ | | | ℓ 2 + H ℓ (1 + γ) / 2 ∥ D (u - u ℓ) ∥ L 2 (Ω) 2 ≲ H ℓ ζ .

Proof

This combines Lemma 3.5 and 4.1 – 4.2 plus Theorem 3.8 and 4.4 in [12].□

Global convergence

This section is devoted to the proof of a general convergence result without higher regularity assumptions. Let $u ∈ A$ and $u ℓ ∈ A ℓ$ solve the minimisation problem (2.3) and (2.5) and set σ := DW(Du) and σ_ℓ := DW(Du_ℓ). For the unstabilised approximation, the a priori error estimates of [7] plus a density argument prove convergence of

∥ σ - σ ℓ ∥ L p ′ (Ω) r + β ∥ u - u ℓ ∥ L 2 (Ω) 2 → 0 as H ℓ → 0 .

Note that β = 0 is permitted. Then, however, uniqueness of u and convergence of $∥ u - u ℓ ∥ L 2 (Ω) 2$ are guaranteed. The point in the following result is that the stabilised approximation converges as well as |||u_ℓ|||_ℓ → 0 even for non-smooth or non-unique minimisers. Under special circumstances, uniqueness of u and the convergence $∥ u - u ℓ ∥ L 2 (Ω) → 0$ can be shown even for β = 0, e.g., in Example 3.3.

Theorem 3.1.

( Global Convergence) Provided $lim ℓ → ∞ H ℓ = 0$ it holds

∥ σ - σ ℓ ∥ L p ′ (Ω) r + β ∥ u - u ℓ ∥ L 2 (Ω) 2 + | | | u ℓ | | | ℓ 2 → 0 as ℓ → ∞.

The proof is based on the following lemma.

Lemma 3.2.

The errors δ_ℓ := σ - σ_ℓand e_ℓ := u - u_ℓsatisfy, for all v_ℓ ∈vV_ℓ, that

∥ δ ℓ ∥ L p ′ (Ω) r + β ∥ e ℓ ∥ L 2 (Ω) 2 ≲ | e ℓ - v ℓ | W 1, p (Ω) r ′ + β ∥ e ℓ - v ℓ | L 2 (Ω) 2 + a ℓ (u ℓ, v ℓ) .

Proof

The minimisation problems (2.3) and (2.5) are equivalent to their respective Euler-Lagrange equations, namely for v ∈ V and v_ℓ ∈ V_ℓ,

∫ Ω σ (x) : D v (x) + 2 β (u (x) - g (x)) · v (x) - f (x) · v (x) d x = 0;

(3.1)

∫ Ω σ ℓ (x) : D v ℓ (x) + 2 β (u ℓ (x) - g (x)) · v ℓ (x) - f (x) · v ℓ (x) d x + a ℓ (u ℓ, v ℓ) = 0 .

(3.2)

Algebraic transformations of the difference of these two equations lead to

∫ Ω δ ℓ : D e ℓ d x + 2 β ∥ e ℓ ∥ L 2 (Ω) 2 = ∫ Ω δ ℓ : D (e ℓ - v ℓ) + 2 β e ℓ · (e ℓ - v ℓ) d x + a ℓ (u ℓ, v ℓ) .

It is shown in ([12], Lemma 3.5) that

∥ δ ℓ ∥ L p ′ (Ω) r ≲ ∫ Ω δ ℓ : D e ℓ d x .

(3.3)

Two Hölder inequalities on the right-hand side and absorbtions of $∥ δ ℓ ∥ L p ′ (Ω)$ and $∥ e ℓ ∥ L 2 (Ω)$ eventually conclude the proof. Further details are dropped for brevity.□

Proof of Theorem 3.1

Given any positive ε, the density of smooth functions in $W 0 1, p (Ω; R m)$ leads to some $v ε ∈ D (Ω; R m)$ such that $∥ u - u D - v ε ∥ W 1, p (Ω) ≲ ε$ . Hence v_ℓ := I_ℓ(v_ε + u_D) - u_ℓ ∈ V_ℓ satisfies

e ℓ - v ℓ = (u - u D - v ε) + (id - I ℓ) (v ε + u D) .

Note that the nodal interpolation I_ℓ(v_ε + u_D) is well-defined since v_ε and u_D are assumed to be smooth. With ([12], Lemma 3.1 – 3.2) it follows that

∥ (id - I ℓ) (v ε + u D) ∥ W 1, p (Ω) ≲ H ℓ → 0 and | | | I ℓ (v ε + u D) | | | ℓ 2 = | | | (id - I ℓ) (v ε + u D) | | | ℓ 2 ≲ H ℓ 1 + γ → 0 as ℓ → ∞.

Since $∥ · ∥ L 2 (Ω) ≲ ∥ · ∥ W 1, p (Ω)$ , this yields some $ℓ 0 ∈ N$ such that

| e ℓ - v ℓ | W 1, p (Ω) r ′ + β ∥ e ℓ - v ℓ ∥ L 2 2 (Ω) + | | | I ℓ (v ε + u D) ∥ | ℓ 2 ≲ ε for all ℓ ≥ ℓ 0 .

A Cauchy inequality applied to the stabilisation norm proves

a ℓ (u ℓ, v ℓ) = - | | | u ℓ | | | ℓ 2 + a ℓ (u ℓ, I ℓ (v ε + u D)) ≤ - 12 ∥ | u ℓ ∥ | ℓ 2 + 12 ∥ | I ℓ (v ε + u D) ∥ | ℓ 2 .

∥ δ ℓ ∥ L p ′ (Ω) r + β ∥ e ℓ ∥ L 2 (Ω) 2 + | | | u ℓ | | | ℓ 2 ≲ ε for all ℓ ≥ ℓ 0 .

□

Example 3.3.

The two-well example from the computational benchmark [18] allows an estimate on $∥ e ℓ ∥ L 2 (Ω)$ even for β = 0. Let n = 2, let $F 1 : = - F 2 : = (3, 2) / 13$ , and let the energy density W be the convex hull of F ↦ |F - F₁|²|F - F₂|². That is

W (F) = max 0, | F | 2 - 1 2 + 4 | F | 2 - (3 F (1) + 2 F (2)) 2 / 13 .

(3.4)

Then ([11], Lemma 9.1) proves, for all v_ℓ ∈ V_ℓ, that

∥ e ℓ ∥ L 2 (Ω) 2 ≲ ∫ Ω δ ℓ : D e ℓ d x + ∥ e ℓ - v ℓ ∥ H 1 (Ω) 2 .

Therefore, the arguments of Lemma 3.2 lead to

∥ δ ℓ ∥ L p ′ (Ω) r + ∥ e ℓ ∥ L 2 (Ω) 2 ≲ | e ℓ - v ℓ | W 1, p (Ω) r ′ + ∥ e ℓ - v ℓ ∥ H 1 (Ω) 2 + a ℓ (u ℓ, v ℓ) .

This result can be used in the proof of Theorem 3.1 in order to obtain

∥ σ - σ ℓ ∥ L p ′ (Ω) r + ∥ u - u ℓ ∥ L 2 (Ω) 2 + | | | u ℓ | | | ℓ 2 → 0 as ℓ → ∞.

A posteriori error estimates

Beyond the a posteriori error analysis of [7], the additional stabilisation term in the discretisation of this paper causes an additional difficulty in that the Galerkin orthogonality does not hold for the natural residual. Inspired from novell developments in the a posteriori error control of elliptic PDEs motivated by inexact solve [14–17], this section presents some guaranteed upper error bound for the discretisation at hand for any approximation u_ℓ which does not necessarily satisfy (3.2) exactly. Thereby inexact solve is included.

Let $u ∈ A$ solve (2.3) and let $u ℓ ∈ A ℓ$ be arbitrary. It is not assumed that u_ℓ solves the discrete problem (2.5); the following theorem holds regardless of this. Recall the definitions of osc_ℓ,q(·) and Π_ℓ from Section ‘Methods: Discretisation and Stabilisation’ and given σ := DW(Du) and σ_ℓ := DW(Du_ℓ), abbreviate

Λ ℓ : = - 2 β (u ℓ - g) + f, e ℓ : = u - u ℓ and δ ℓ : = σ - σ ℓ .

Theorem 4.1.

Given any $w ℓ ∈ W 1, p (Ω; R m)$ with w_ℓ = u - u_ℓon the boundary ∂ Ω, and given any $τ ∈ H (div, Ω; R m × n)$ , it holds, for all 2 ≤ q ≤ p and for some constant ϰ known from ([12], Lemma 3.5), that

ϰ / 2 ∥ δ ℓ ∥ L p ′ (Ω) r + β ∥ e ℓ ∥ L 2 (Ω) 2 ≤ r ϰ / 2 1 - r ′ / r ′ | w ℓ | W 1, p (Ω) r ′ + β ∥ w ℓ ∥ L 2 (Ω) 2 + ∥ σ ℓ - τ ∥ L q ′ (Ω) + ∥ Π ℓ Λ ℓ + div τ ∥ L q ′ (Ω) + osc ℓ, q ′ (Λ ℓ) ∥ e ℓ - w ℓ ∥ W 1, q (Ω) .

The constant ϰ depends on problem-specific data such as $∥ u ∥ W 1, p (Ω)$ and the size of the domain Ω. Refer to the proof of Lemma 3.5 in [12] for details.

Before the proofs conclude this section, some practical choice of τ in Theorem 4.1 is discussed as some Raviart-Thomas finite element functions in

RT 0 (T ℓ) : = {τ RT ∈ P 1 (T ℓ) ∩ H (div, Ω) : ∀ T ∈ T ℓ ∃ a, b, c ∈ R ∀ x ∈ T, τ RT (x) = (a, b) + cx} .

We suggest the computation (or an accurate approximation) of

μ ℓ : = min τ ∈ RT 0 (T ℓ) m ∥ σ ℓ - τ ∥ L q ′ (Ω) + ∥ Π ℓ Λ ℓ + div τ ∥ L q ′ (Ω)

(4.1)

and emphasise that any upper bound is allowed in Theorem 4.1. This leads to

ϰ / 2 ∥ δ ℓ ∥ L p ′ (Ω) r + β ∥ e ℓ ∥ L 2 (Ω) 2 ≤ r ϰ / 2 1 - r ′ / r ′ | w ℓ | W 1, p (Ω) r ′ + β ∥ w ℓ ∥ L 2 (Ω) 2 + μ ℓ + osc ℓ, q ′ (Λ ℓ) ∥ e ℓ - w ℓ ∥ W 1, q (Ω) .

The algorithm of ([20], Prop. 4.1) computes some w_ℓ from (id-I_ℓ)u_D with

∥ w ℓ ∥ L q (T) ≈ h T 1 / q ∥ (id - I ℓ) u D ∥ L q (∂T ∩ ∂Ω) and ∥ D w ℓ ∥ L q (T) ≲ h T 1 / q - 1 ∥ (id - I ℓ) u D ∥ L q (∂T ∩ ∂Ω) + h T 1 / q ∥ ∂ (id - I ℓ) u D / ∂s ∥ L q (∂T ∩ ∂Ω) .

(4.2)

(The proof of the second assertion is analogous to that of ([20], Prop. 4.1) and the first is an immediate consequence of the design of w_ℓ). This and $∥ e ℓ - w ℓ ∥ W 1, q (Ω) ≲ 1$ for bounded u_ℓ (i.e. solely $∥ u ℓ ∥ W 1, p (Ω) ≲ 1$ is assumed) lead to the practical estimate μ_ℓ as a computable guaranteed upper bound of the left-hand side of Theorem 4.1. Since the minimisation of (4.1) is computationally intensive for q ≠ 2, Section ‘Numerical experiments’ actually computes an approximation of μ_ℓ, based on q = 2.

The choice τ = σ in Theorem 4.1 shows that the right-hand side is in fact optimal up to oscillations. The reliability-efficiency gap of [18] is visible here in that we have no further estimate on $∥ u ℓ ∥ W 1, p (Ω)$ [7, 18]. However, additional smoothness assumptions on u may lead to refined estimates on the term $∥ e ℓ - w ℓ ∥ W 1, q (Ω)$ (cf. Section ‘Refined analysis for an interface model problem’). The following result indicates that μ_ℓ is sharp in the sense that it converges with the correct convergence rate. This theorem employs the Fortin interpolation operator I_F,ℓ defined for $τ ∈ H (div, Ω) ∩ L t (Ω; R n)$ with t > 2 by $I F, ℓ τ ∈ RT 0 (T ℓ)$ and

⨏ F n F · (id - I F, ℓ) τ d s = 0 for all F ∈ F ℓ .

Here and in the following, n_F denotes a unit normal vector of the side F; the direction of n_F arbitrary, but fixed for a given side F. For the improved regularity of stress in the class of degenerate convex minimisation problems at hand, we refer to [3, 21].

Theorem 4.2.

( Efficiency) If the exact stress σ is sufficiently regular such that its Fortin interpolant $τ ℓ = I F, ℓ σ ∈ RT 0 (T ℓ; R m × n)$ is defined, it holds

∥ σ ℓ - τ ℓ ∥ L q ′ (Ω) + ∥ Π ℓ Λ ℓ + div τ ℓ ∥ L q ′ (Ω) ≲ ∥ δ ℓ ∥ L q ′ Ω + 2 β ∥ e ℓ ∥ L q ′ (Ω) + ∥ (id - I F, ℓ) σ ∥ L q ′ (Ω) .

It is expected that $∥ (id - I F, ℓ) σ ∥ L q ′ (Ω) ≲ H ℓ$ . This is shown in ([22], Prop. 3.6) for q^′ = 2 and therefore also holds for q^′ ≤ 2. Hence the right-hand side of the assertion of Theorem 4.2 converges with the (expected) optimal convergence rates.

Proof of Theorem 4.1.

Let ϰ be the reciprocal of c₁ in ([12], Lemma 3.5), which is also the multiplicative constant hidden in (3.3). Recall Young’s inequality, which reads $ab ≤ a r / r + b r ′ / r ′$ for a, b > 0. This, (3.3) and the continuous Euler-Lagrange equation (3.1) show, for v = e_ℓ - w_ℓ ∈ V, that

ϰ ∥ δ ℓ ∥ L p ′ (Ω) r + 2 β ∥ e ℓ ∥ L 2 (Ω) 2 ≤ ∫ Ω δ ℓ : D v + 2 β e ℓ · v d x + ∫ Ω δ ℓ : D w ℓ + 2 β e ℓ · w ℓ d x ≤ - ∫ Ω σ ℓ : D v - Λ ℓ · v d x + β ∥ e ℓ ∥ L 2 (Ω) 2 + β ∥ w ℓ ∥ L 2 (Ω) 2 + ϰ / 2 ∥ δ ℓ ∥ L p ′ (Ω) r + r ϰ / 2 1 - r ′ / r ′ | w ℓ | W 1, p (Ω) r ′ .

Hence $Res ℓ (v) : = - ∫ Ω (σ ℓ : D v - Λ ℓ · v) d x$ satisfies

ϰ / 2 ∥ δ ℓ ∥ L p ′ (Ω) r + β ∥ e ℓ ∥ L 2 (Ω) 2 ≤ Res ℓ (v) + r ϰ / 2 1 - r ′ / r ′ | w ℓ | W 1, p (Ω) r ′ + β ∥ w ℓ ∥ L 2 (Ω) 2 .

Let $C q ′$ denote the Poincaré constant of convex domains with respect to the $W 1, q ′$ norm. The fundamental theorem of calculus on some one-dimensional arc shows that C_∞ ≤ 1. The paper [23] proves C₁ = 1 / 2. Hence, operator-interpolation arguments [24, 25] prove $C q ′ ≤ (1 / 2) 1 / q ′ ≤ 1$ . The Poincaré inequality shows, for any 2 ≤ q ≤ p, that

∫ Ω (id - Π ℓ) Λ ℓ · v d x = ∫ Ω h ℓ (id - Π ℓ) Λ ℓ · 1 h ℓ (id - Π ℓ) v d x ≤ ∥ h ℓ (id - Π ℓ) Λ ℓ ∥ L q ′ (Ω) ∥ D v ∥ L q (Ω) = osc ℓ, q ′ (Λ ℓ) ∥ D v ∥ L q (Ω) .

For any $τ ∈ H (div, Ω; R m × n)$ , the Hölder and Poincaré inequalities show

Res ℓ (v) = - ∫ Ω ((σ ℓ - τ) : D v - (Π ℓ Λ ℓ + div τ) · v - (id - Π ℓ) Λ ℓ · v) d x ≤ ∥ σ ℓ - τ ∥ L q ′ (Ω) + ∥ Π ℓ Λ ℓ + div τ ∥ L q ′ (Ω) + osc ℓ, q ′ (Λ ℓ) ∥ v ∥ W 1, q (Ω) .

Proof of Theorem 4.2

The triangle inequality yields

∥ σ ℓ - τ ℓ ∥ L q ′ (Ω) ≤ ∥ (id - I F, ℓ) σ ∥ L q ′ (Ω) + ∥ δ ℓ ∥ L q ′ Ω .

Since f = 2β(u - g)-divσ, the commutative property divI_F,ℓ = Π_ℓdiv (cf. ([22], p. 129)) yields

∥ Π ℓ Λ ℓ + div τ ℓ ∥ L q ′ (Ω) = 2 β ∥ Π ℓ e ℓ ∥ L q ′ (Ω) ≤ 2 β ∥ e ℓ ∥ L q ′ (Ω) .

Refined analysis for an interface model problem

This section is devoted for a model scenario from phase transition problems [18] with some solution u that is smooth outside some one-dimensional interface Γ. Suppose some (possibly non-unique) minimiser u of the continuous problem (2.3) satisfies $u ∈ W 1, ∞ (Ω; R m) ∩ W 2, p (Ω ∖ Γ; R m)$ for some finite union Γ of (n - 1) dimensional Lipschitz surfaces in $Ω ¯$ . Since Ω has a Lipschitz boundary, this implies Lipschitz continuity of u on Ω. We refer to [19] for sufficient conditions for $u ∈ W 1, ∞ (Ω; R m)$ and conclude that the remaining assumption $u ∈ W 2, p (Ω ∖ Γ; R m)$ is the essential hypothesis expected in many interface problems. Let $u ℓ ∈ A ℓ$ be the (unique) minimiser of the discrete stabilised problem (2.5). In the following, also Γ = ∅ is permitted to extend previous results [12] for highly regular minimisers.

The following theorem leads to a priori convergence rates for the interface model problem. Thereby it recovers the results of [12] for problems with piecewise smooth exact solution.

We will abbreviate the set of all triangles that are touched by Γ as $T ℓ (Γ) : = {T ∈ T ℓ : dist (T, Γ) = 0}$ , its cardinality as $T ℓ (Γ)$ , its union as $Ω Γ, ℓ : = int (⋃ T ℓ (Γ))$ with volume |Ω_Γ,ℓ| and its complement as $Ω Γ, ℓ C : = Ω ∖ Ω Γ, ℓ ¯$ .

Theorem 5.1.

Provided β > 0, it holds

∥ δ ℓ ∥ L p ′ (Ω) r + ∥ e ℓ ∥ L 2 (Ω) 2 + ∥ | u ℓ ∥ | ℓ 2 ≲ H ℓ 1 + γ | u | H 2 (Ω ∖ Γ) 2 + H ℓ 2 | u | W 1, ∞ (Ω) 2 + H ℓ r / (r - 1) | u | W 2, p (Ω Γ, ℓ C) r / (r - 1) + H ℓ γ + n - 1 | u | W 1, ∞ (Ω) 2 | T ℓ (Γ) | + | u | W 1, ∞ (Ω) r / (r - 1) | Ω Γ, ℓ | r / ((r - 1) p) .

Remark 5.2.

In the case of uniform mesh refinements we may expect $| T ℓ (Γ) | ≈ H ℓ 1 - n$ and |Ω_Γ,ℓ| ≈ H_ℓ and Theorem 5.1 simplifies to

∥ δ ℓ ∥ L p ′ (Ω) r + ∥ e ℓ ∥ L 2 (Ω) 2 + ∥ | u ℓ ∥ | ℓ 2 ≲ H ℓ min γ, 2 | u | W 1, ∞ (Ω) 2 + H ℓ r / ((r - 1) p) | u | W 1, ∞ (Ω) r / (r - 1) .

Proof.

With w_ℓ = (id - I_ℓ)e_ℓ = (id - I_ℓ)u, a Young inequality, (3.3) and ([12], Theorem 3.8) yield

∥ δ ℓ ∥ L p ′ (Ω) r + ∥ e ℓ ∥ L 2 (Ω) 2 + ∥ | u ℓ ∥ | ℓ 2 ≲ | w ℓ | W 1, p (Ω) r / (r - 1) + ∥ w ℓ ∥ L 2 (Ω) 2 + ∥ | I ℓ u ∥ | ℓ 2 .

Theorem 4.4.4 in [25] shows $∥ w ℓ ∥ L 2 (Ω) ≲ ∥ w ℓ ∥ L ∞ (Ω) ≲ H ℓ | u | W 1, ∞ (Ω)$ and

| w ℓ | W 1, p (Ω) p = | w ℓ | W 1, p (Ω Γ, ℓ) p + | w ℓ | W 1, p (Ω Γ, ℓ C) p ≲ | u | W 1, ∞ (Ω Γ, ℓ) p | Ω Γ, ℓ | + H ℓ p | u | W 2, p (Ω Γ, ℓ C) p .

Let $ω F = ⋃ T ∈ T ℓ F ⊂ T T$ be the patch of a side $F ∈ F ℓ$ , and set $F ℓ (Γ) = {F ∈ F ℓ (Ω) : ω F ∩ Γ ≠ ∅}$ and $F ℓ C (Γ) = F ℓ (Ω) ∖ F ℓ (Γ)$ . Note that [Du]_F = 0 for $F ∈ F ℓ C (Γ)$ . Then

∥ | I ℓ u ∥ | ℓ 2 = H ℓ 1 + γ ∑ F ∈ F ℓ C (Γ) h F - 1 ∥ [D w ℓ] F ∥ L 2 (F) 2 + ∑ F ∈ F ℓ (Γ) h F - 1 ∥ [D I ℓ u] F ∥ L 2 (F) 2 ·

The first sum can be estimated as in the proof of ([12], Lemma 3.2), the second sum with

∥ [D I ℓ u] F ∥ L 2 (F) 2 ≲ h F n - 1 | I ℓ u | W 1, ∞ (F) 2 ≲ h F n - 1 | u | W 1, ∞ (F) 2 .

The observation $| F ℓ (Γ) | ≤ (n + 1) | T ℓ (Γ) |$ concludes the proof.□

Together with Theorem 5.1, the subsequent result implies strong convergence of the gradients in the model interface problem as H_ℓ → 0.

Theorem 5.3.

Under the aforementioned conditions on the (possibly non-unique) exact minimiser $u ∈ W 1, ∞ (Ω; R m) ∩ W 2, p (Ω ∖ Γ; R m)$ , the error e_ℓ = u - u_ℓof the discrete solution $u ℓ ∈ A ℓ$ of (2.5) satisfies

∥ D e ℓ ∥ L 2 (Ω) ≲ ∥ e ℓ ∥ L 2 (Ω) 1 / 3 + H ℓ 5 / 6 ∥ ∂ 2 u D / ∂ s 2 ∥ L 2 (∂Ω) 1 / 3 + H ℓ (1 - γ) / 2 ∥ | u ℓ ∥ | ℓ + H ℓ - (1 + γ) / 4 ∥ | u ℓ ∥ | ℓ 1 / 2 ∥ e ℓ ∥ L 2 (Ω) 1 / 2 + H ℓ 5 / 4 ∥ ∂ 2 u D / ∂ s 2 ∥ L 2 (Ω) 1 / 2 .

Proof

The basic idea of gradient control is the generalisation of the interpolation estimate H¹(Ω) = [L²(Ω), H²(Ω)]_1/2 for a reduced domain Ω∖Γ; refer to [24, 25] for a detailed analysis of interpolation spaces. Let w_ℓ be the boundary value interpolation of (id - I_ℓ)u_D as described in ([20], Prop. 4.1), such that w_ℓ satisfies the inequalities in (4.2). A piecewise integration by parts shows, for $v : = e ℓ - w ℓ ∈ W 0 1, p (Ω; R m)$ , that

∥ D e ℓ ∥ L 2 (Ω) 2 = ∫ Ω D (u - u ℓ) : D v d x + ∫ Ω D e ℓ : D w ℓ d x ≤ ∫ Γ v · [D u] Γ n Γ d s - ∫ Ω ∖ Γ v · Δ u d x - ∑ F ∈ F ℓ (Ω) ∫ F v · [D u ℓ] F n F d s + ∥ D e ℓ ∥ L 2 (Ω) ∥ D w ℓ ∥ L 2 (Ω),

where n_Γ is a unit normal vector of the interface Γ. The Lipschitz continuity of u implies |[Du]_Γn_Γ| ≲ 1. This and the trace inequality on Γ lead to

∫ Γ v · [D u] Γ n Γ d s ≲ ∥ v ∥ L 2 (Γ) ≲ ∥ v ∥ L 2 (Ω) + ∥ v ∥ L 2 (Ω) 1 / 2 ∥ D v ∥ L 2 (Ω) 1 / 2 .

The case $Γ = ∅$ is contained in ([12], Theorem 4.4). The piecewise Laplacian of u is bounded in L²(Ω) and so (with the generic constant $C : = ∥ Δ u ∥ L 2 (Ω ∖ Γ)$ hidden in the notation C ≈ 1)

∫ Ω ∖ Γ v · Δ u d x ≲ ∥ v ∥ L 2 (Ω)

The elementwise trace inequality ([25], Theorem 1.6.6, p. 39) for an n-dimensional simplex T and one of its sides F, and $f ∈ W 1, q (T; R m)$ , 1 ≤ q < ∞, reads

∥ f ∥ L q (F) q ≲ h T - 1 ∥ f ∥ L q (T) q + ∥ f ∥ L q (T) q - 1 ∥ D f ∥ L q (T) ≲ h T - 1 ∥ f ∥ L q (T) q + h T q - 1 ∥ D f ∥ L q (T) q .

The term $∫ F v · [D u ℓ] F n F d s$ and the stabilisation ∥ |u_ℓ∥ |_ℓ are already analysed in the Estimate on C in the proof of ([12], Theorem 4.4). This results in

∑ F ∈ F ℓ (Ω) ∫ F v · [D u ℓ] F n F d s ≲ ∥ | u ℓ ∥ | ℓ H ℓ (1 - γ) / 2 ∥ D v ∥ L 2 (Ω) + H ℓ - (1 + γ) / 2 ∥ v ∥ L 2 (Ω) .

The preceding estimates plus the absorbtion of $∥ D e ℓ ∥ L 2 (Ω)$ lead to

∥ D e ℓ ∥ L 2 (Ω) 2 ≲ ∥ v ∥ L 2 (Ω) + ∥ v ∥ L 2 (Ω) 1 / 2 ∥ D v ∥ L 2 (Ω) 1 / 2 + ∥ D w ℓ ∥ L 2 (Ω) 2 + ∥ | u ℓ ∥ | ℓ H ℓ (1 - γ) / 2 ∥ D v ∥ L 2 (Ω) + H ℓ - (1 + γ) / 2 ∥ v ∥ L 2 (Ω) .

The triangle inequality applied to v = e_ℓ - w_ℓ and some careful elementary analysis to absorb $∥ D e ℓ ∥ L 2 (Ω) 1 / 2$ eventually lead to

∥ D e ℓ ∥ L 2 (Ω) ≲ ∥ e ℓ ∥ L 2 (Ω) 1 / 3 + ∥ w ℓ ∥ L 2 (Ω) 1 / 3 + | w ℓ | H 1 (Ω) + H ℓ (1 - γ) / 2 ∥ | u ℓ ∥ | ℓ + H ℓ - (1 + γ) / 4 ∥ | u ℓ ∥ | ℓ 1 / 2 ∥ e ℓ ∥ L 2 (Ω) + ∥ w ℓ ∥ L 2 (Ω) 1 / 2 .

The inequalities (4.2), Poincaré and Friedrichs inequalities on sides $F ∈ F ℓ (∂Ω)$ and removal of higher-order terms in H_ℓ conclude the proof.□

The following theorem is an improved a posteriori estimate based on Theorems 4.1 and 5.3.

Theorem 5.4.

Recall $u ∈ W 1, ∞ (Ω; R m) ∩ W 2, p (Ω ∖ Γ; R m)$ , the definitions e_ℓ := u - u_ℓand δ_ℓ := σ - σ_ℓfor σ := DW(Du) and σ_ℓ := DW(Du_ℓ), and the definition of Λ_ℓfrom Section ‘A posteriori error estimates’. Set

M (τ) : = ∥ σ ℓ - τ ∥ L 2 (Ω) + ∥ Π ℓ Λ ℓ + div τ ∥ L 2 (Ω) + osc ℓ, 2 (Λ ℓ) for all τ ∈ H (div, Ω; R m × n) .

Provided β>0, it holds

∥ δ ℓ ∥ L p ′ (Ω) r + ∥ e ℓ ∥ L 2 (Ω) 2 ≲ M (τ) 6 / 5 + H ℓ - (1 + γ) / 3 M (τ) 4 / 3 ∥ | u ℓ ∥ | ℓ 2 / 3 + M (τ) H ℓ (1 - γ) / 2 ∥ | u ℓ ∥ | ℓ + H ℓ 1 - γ / 4 ∥ | u ℓ ∥ | ℓ 1 / 2 + H ℓ min 5, r ′ (1 + 1 / p)

and

∥ D e ℓ ∥ L 2 (Ω) 2 ≲ M (τ) 2 / 5 + H ℓ - (1 + γ) / 9 M (τ) 4 / 9 ∥ | u ℓ ∥ | ℓ 2 / 9 + H ℓ min 5 / 3, r ′ (1 + 1 / p) / 3 + M (τ) 1 / 3 H ℓ (1 - γ) / 2 ∥ | u ℓ ∥ | ℓ + H ℓ 1 - γ / 4 ∥ | u ℓ ∥ | ℓ 1 / 2 1 / 3 + H ℓ 1 - γ ∥ | u ℓ ∥ | ℓ 2 + H ℓ - (1 + γ) / 2 ∥ | u ℓ ∥ | ℓ M (τ) 6 / 5 + H ℓ - (1 + γ) / 3 M (τ) 4 / 3 ∥ | u ℓ ∥ | ℓ 2 / 3 + H ℓ min 5, r ′ (1 + 1 / p) 1 / 2 + H ℓ - (1 + γ) / 2 ∥ | u ℓ ∥ | ℓ M (τ) 1 / 2 H ℓ (1 - γ) / 2 ∥ | u ℓ ∥ | ℓ + H ℓ 1 - γ / 4 ∥ | u ℓ ∥ | ℓ 1 / 2 1 / 2

The generic constants in Theorem 5.4 depend on problem-specific data such as the shapes of Ω and Γ as well as the generic constant ϰ of Theorem 4.1.

Theorem 5.5.

Theorem 5.4 holds verbatim in Example 3.3 and in the modified two-well problem of Subsection ‘Modified two-well benchmark’, where β = 0.

Remark 5.6.

The assertion of Theorem 5.4 holds for any discrete u_ℓ ∈ u_D,ℓ + V_ℓ which may approximate the discrete unique exact solution of (2.5). This allows the inexact SOLVE via an iterative procedure.

Proof of Theorem 5.4

Choose w_ℓ as in the proof of Theorem 5.3. Then Theorem 4.1 with q = 2 and (4.2) imply

∥ δ ℓ ∥ L p ′ (Ω) r + ∥ e ℓ ∥ L 2 (Ω) 2 ≲ M (τ) ∥ e ℓ - w ℓ ∥ H 1 (Ω) + | w ℓ | W 1, p (Ω) r ′ + ∥ w ℓ ∥ L 2 (Ω) 2 ≲ M (τ) | e ℓ | H 1 (Ω) + ∥ e ℓ ∥ L 2 (Ω) + H ℓ 3 / 2 + H ℓ min 5, r ′ (1 + 1 / p) .

Theorem 5.3 provides an estimate of the semi-norm $| e ℓ | H 1 (Ω)$ . A Young inequality shows $H ℓ 5 / 6 M (τ) ≲ H ℓ 5 + M (τ) 6$ . The absorbtion of $∥ e ℓ ∥ L 2 (Ω)$ then proves the first assertion. The second assertion is an immediate consequence of the first one, Theorem 5.3 and several algebraic transformations.

Numerical experiments

This section illustrates the theoretical estimates and their impact on the reliability-efficiency gap on 2D benchmarks in computational microstructures [18, 26].

Numerical algorithms

The adaptive finite element method (AFEM) and algorithmic details on the implementation in MATLAB in the spirit of [27] concern the state-of-the-art AFEM loop

SOLVE → ESTIMATE → MARK → REFINE

and are explained below together with some notation.

Solve

The stabilised discrete problem (2.5) is solved in a nested iteration on a given triangulation $T ℓ$ with MATLAB’s standard-minimiser fminunc with default tolerances. Gradient and Hessian of the discrete energy are available and therefore provided to fminunc. We set γ = 1 in the stabilisation term (2.4) in all our experiments. This is motivated by ([12], Theorem 4.4) which suggest that γ = 1 yields an optimal convergence rate. The discrete solution of the previous AFEM loop iteration serves as a start vector for fminunc; for the first iteration, the initial vector is zero everywhere up to the Dirichlet boundary nodes. Since the Galerkin orthogonality is not required in Theorem 4.1, the termination of an iterative realisation for SOLVE is not a sensitive issue. In the computational PDEs, it is a fundamental issue to involve inexact solve. In this paper, however, the numerical examples are run with the standard settings of MATLAB.

Estimate

The refinement indicator results from the error estimator of Theorem 4.1. As in the work of Repin [28], the computation of the minimiser $τ ∈ RT 0 (T ℓ) m$ of

∥ σ ℓ - τ ∥ L 2 (Ω) + ∥ Π ℓ Λ ℓ + div τ ∥ L 2 (Ω)

(6.1)

runs Algorithm 1 based on the formula

a + b 2 = min s > 0 (1 + s) a 2 + (1 + 1 / s) b 2 for a, b > 0

Algorithm 1 Approximate flux computation

The stopping criterion of Algorithm 1 monitors relative changes and avoids degenerate values of s. Undisplayed experiments have conviced us that a maxmium of three iterations and a stopping tolerance of $ε M 0.8$ (with the machine precision ε_M) yield satisfying results. The iteration is stopped whenever s, 1 / s or the relative change of s drops below this tolerance. As an additional precaution, the iteration also stops if the linear system is deemed “nearly singular” by MATLAB. Our experiments convinced us that ignoring this warning causes a breakdown with NaNs. Note that if q ≠ 2, we still minimise the L² sums in (6.1) to avoid the computational cost of a nonlinear solve. With the computed minimiser τ, Section ‘A posteriori error estimates’ yields the error estimator

η F, q ′ : = ∥ σ ℓ - τ ∥ L q ′ (Ω) + ∥ Π ℓ Λ ℓ + div τ ∥ L q ′ (Ω) + osc ℓ, q ′ (Λ ℓ) .

This will be compared with the well-established residual based a posteriori error estimator[7]

η R, q ′ : = ∑ T ∈ T ℓ h T q ′ ∥ Λ ℓ ∥ L q ′ (T) q ′ 1 / q ′ + ∑ F ∈ F ℓ (Ω) h F ∥ [σ ℓ] F · n F ∥ L q′ (F) q ′ 1 / q ′,

which is reliable for the original discretisation without stabilisation. Undisplayed experiments computed the averaging error estimator[18], which is founded on the same theoretical background as $η R, q ′$ and therefore yielded essentially the same convergence rates.

The error estimators in Theorem 5.4 read

η L, 2 : = η F, 2 6 / 5 + H ℓ - (1 + γ) / 3 η F, 2 4 / 3 ∥ | u ℓ ∥ | ℓ 2 / 3 + η F, 2 H ℓ (1 - γ) / 2 ∥ | u ℓ ∥ | ℓ + H ℓ 1 - γ / 4 ∥ | u ℓ ∥ | ℓ 1 / 2 + H ℓ min 5, r ′ (1 + 1 / p)

η H, 2 : = η F, 2 2 / 5 + H ℓ - (1 + γ) / 9 η F, 2 4 / 9 ∥ | u ℓ ∥ | ℓ 2 / 9 + H ℓ min 5 / 3, r ′ (1 + 1 / p) / 3 + η F, 2 1 / 3 H ℓ (1 - γ) / 2 ∥ | u ℓ ∥ | ℓ + H ℓ 1 - γ / 4 ∥ | u ℓ ∥ | ℓ 1 / 2 1 / 3 + H ℓ 1 - γ ∥ | u ℓ ∥ | ℓ 2 + H ℓ - (1 + γ) / 2 ∥ | u ℓ ∥ | ℓ η F, 2 6 / 5 + H ℓ - (1 + γ) / 3 η F, 2 4 / 3 ∥ | u ℓ ∥ | ℓ 2 / 3 + H ℓ min 5, r ′ (1 + 1 / p) 1 / 2 + H ℓ - (1 + γ) / 2 ∥ | u ℓ ∥ | ℓ η F, 2 1 / 2 H ℓ (1 - γ) / 2 ∥ | u ℓ ∥ | ℓ + H ℓ 1 - γ / 4 ∥ | u ℓ ∥ | ℓ 1 / 2 1 / 2 .

MARK

For any given $T ∈ T ℓ$ with its set of faces $F (T)$ , $∂T = ⋃ F (T)$ , and given τ from (6.1), set

η F q ′ (T) : = ∥ σ ℓ - τ ∥ L q ′ (T) q ′ + ∥ Π ℓ Λ ℓ + div τ ∥ L q ′ (T) q ′ + h T q ′ ∥ (id - Π ℓ) Λ ℓ ∥ L q ′ (T) q ′ . η R q ′ (T) : = | T | q ′ / n ∥ Λ ℓ ∥ L q ′ (T) q ′ + | T | 1 / n ∑ F ∈ F ℓ (Ω) ∩ F (T) ∥ [σ ℓ] F · n F ∥ L q ′ (F) q ′ .

Let $η q ′ (T)$ be one of the refinement indicators $η F q ′ (T)$ and $η R q ′ (T)$ . Some greedy algorithm computes $M ℓ ⊂ T ℓ$ of (almost) minimal cardinality such that

∑ T ∈ M ℓ η q ′ (T) ≥ 1 / 2 ∑ T ∈ T ℓ η q ′ (T) .

Refine

This step computes the smallest refinement $T ℓ + 1$ of $T ℓ$ with $M ℓ ⊂ T ℓ ∖ T ℓ + 1$ based on the red-green-blue refinement strategy as illustrated in Figure 2. This refinement involves some closure algorithm to avoid hanging nodes.

Two-well benchmark

The computational microstructure benchmark of ([18], Section 2) considers two wells with W from (3.4) in Example 3.3. The energy is given by (1.1) on the domain $Ω = (0, 1) × (0, 3 / 2) ⊂ R 2$ with

g (x) : = - 3 t 5 / 128 - t 3 / 3 and u D (x) : = g (x) for t ≤ 0, t 3 / 24 + t for t ≥ 0

for $t : = (3 (x 1 - 1) + 2 x 2) / 13$ ; p = q = 4 and f ≡ 0. The unique minimiser u of $min v ∈ A E (v)$ with $A = u D + W 0 1, 4 (Ω)$ reads u=u_D ([18], Theorem 2.1) and β = 1 allows for Theorems 5.1 – 5.4 to hold. An initial triangulation $T 0$ is given by a criss triangulation of (0,1)×(0,3/2) with 12 congruent triangles and the two interior nodes (1/2,1/2) and (1/2,1). The adaptive algorithm of Subsection ‘Numerical algorithms’ computes a sequence of discrete solutions (u_ℓ)_ℓ and stresses (σ_ℓ)_ℓ, as well as error estimators η_F and η_R with and without stabilisation for uniform and adaptive meshes and led to Figure 3 with overall observations of Section ‘Conclusions’. The empirical convergence rates for uniform and R- as well as F-adapted mesh-refining are collected in Table 1. Note that the error estimator η_L performs better than η_F. This is evident from the table for uniform mesh refinements, but a closer look at Figure 3 reveals that even in the adaptive scenarios, η_L converges slightly faster than η_F. This is in accordance to the theory of Section ‘Refined analysis for an interface model problem’ where η_L is derived from η_F based on additional smoothness assumptions.

Table 1 Observed convergence rates in Figures 3 , 4 , 6 and 7 for uniform and adaptive mesh refining

Full size table

Modified two-well benchmark

This subsection concerns a modification of the previous problem with (3.4) and a linear right-hand side for β = 0 and f(x) := -div(DW(Du_D(x))) and unique solution u = u_D as before. Note that Example 3.3 applies to this problem, and so the proof of Theorem 3.1 yields

∥ σ - σ ℓ ∥ L p ′ (Ω) r + ∥ u - u ℓ ∥ L 2 (Ω) 2 + ∥ | u ℓ ∥ | ℓ 2 → 0 as ℓ → ∞

and Theorems 5.1–5.4 hold as well. The algorithms of Subsection ‘Numerical algorithms’ ran with and without stabilisation for uniform and adaptive meshes with the same initial triangulation as in Subsection ‘Two-well benchmark’ and led to Figure 4 with overall observations of Section ‘Conclusions’. The empirical convergence rates for uniform and R- as well as F-adapted mesh-refining are collected in Table 1 for completeness although they are almost identical with those observed in Subsection ‘Two-well benchmark’.

Three-well benchmark

The energy density W of ([26], Example 5.9.3, p. 72) is the convex hull of min{|F|², |F - (1, 0)|², |F - (0, 1)|²} with explicit form in ([26], Example 5.6.4, p. 58). Let furthermore $Ω = (0, 1) 2 ⊂ R 2$ and u_D(x₁, x₂) := a(x₁ - 1/4) + a(x₂ - 1/4) with a(t) := t³/6 + t / 8 for t ≤ 0 and a(t) := t⁵/40 + t³/8 for $t ≥ 0$ . Then the energy is given by (1.1) with β = 0 and f := -divDW(Du_D). The exact solution u = u_D satisfies the interface condition of Section ‘Refined analysis for an interface model problem’ and allows Theorem 5.3 to hold. Theorems 5.1 and 5.4 do not apply because β = 0. We use the grid of Figure 5 as initial triangulation to resolve discontinuities in ∇f.

The algorithms of Subsection ‘Numerical algorithms’ ran with and without stabilisation for uniform and adaptive meshes and led to Figure 6 with overall observations of Section ‘Conclusions’. Beyond those general conclusions, this example demonstrates the difficulties with ill-conditioned Hessians. While the unstabilised method reaches 10⁶ degrees of freedom without difficulty on uniform meshes, the adapted algorithms fail without stabilisation beyond 687 324 degrees of freedom (η_F-adaptive) and 33 169 degrees of freedom (η_R-adaptive). MATLAB’s error message “Input to EIG must not contain NaN or Inf” indicates that a matrix operation returned non-finite numbers let fminunc break down. Undisplayed numerical experiments show condition numbers up to 10¹⁰ and beyond. The empirical convergence rates for uniform and R- as well as F-adapted mesh-refining are collected in Table 1. Moreover, Figure 1 in Section ‘Background’ reveals that stabilisation not only remedies ill-conditioned Hessians but thereby indeed allows for reduced errors in the discrete solution.

An optimal design example

The energy density of the topology optimisation problem of [3, 8, 29–33] reads

W (F) : = ϕ (| F |) for F ∈ R 2 with ϕ (t) : = λ / 2 + t 2 for 0 ≤ t ≤ λ, 2 λ (t - λ / 2) for λ ≤ t ≤ 2 λ, t 2 / 2 + λ for t ≥ 2 λ .

This leads to problem (2.3) with β = 0, λ = 0.0084,u_D ≡ 0 and f ≡ 1. Since regularity of the solutions is unclear, only the results of Sections ‘Global convergence’, ‘A posteriori error estimates’, ‘Refined analysis for an interface model problem’ and ‘Numerical experiments’ apply. As initial triangulation $T 0$ , we use the coarsest cross triangulation $T 0 = {conv {(0, 0), (1, 0), (0, 1)}, conv {(1, 0), (0, 1), (1, 1)}}$ of Ω = (0, 1)².

The algorithms of Subsection ‘Numerical algorithms’ ran with and without stabilisation for uniform and adaptive meshes and led to Figure 7 with the overall observations of Section ‘Conclusions’. The empirical convergence rates for uniform and R- as well as F-adapted mesh-refining are collected in Table 1. Undocumented experiments with a modified lower-order term f and known exact solution u led to the same convergence rates of the error estimators and confirm their accuracy.

Discussion of Empirical Convergence Rates

Global convergence without regularity assumptions

Theorem 3.1 asserts that $∥ σ - σ ℓ ∥ L p ′ (Ω)$ , $β ∥ u - u ℓ ∥ L 2 (Ω)$ , and ∥ |u_ℓ∥ |_ℓ all tend to zero as H_ℓ → 0. The plain convergence result applies to all examples from Subsections ‘Two-well benchmark’, ‘An optimal design example’, ‘Three-well benchmark’, and ‘An optimal design example’ for the uniform mesh-refinements with H_ℓ+1 = H_ℓ / 2. The numerical experiments, however, show empirical convergence rates displayed in the first columns of Table 1. The adaptive algorithms do not reflect the condition H_ℓ → 0 explicitly and hence convergence is not guaranteed a priori. Undisplayed investigations show that indeed in the R-adapted version of the three-well example of Subsection ‘Three-well benchmark’, this condition H_ℓ → 0 does not appear to be true for more than 4 978 degrees of freedom. In all other experiments we observe convergence rates even for unstabilised discretisations.

Empirical convergence rates for interface model problems

Theorem 5.1 provides an a priori error estimate and an estimate of the stabilisation norm. It applies to the benchmark of Subsections ‘Two-well benchmark’, ‘An optimal design example’, ‘Three-well benchmark’, and ‘An optimal design example’ only, because of β > 0 and Example 3.3, and the smoothness conditions imposed upon u from Section ‘Refined analysis for an interface model problem’. Recall the definitions of $T ℓ (Γ)$ , Ω_Γ,ℓ and $Ω Γ, ℓ C$ from Section ‘Refined analysis for an interface model problem’ and assume $∥ u ∥ L 2 (Ω ∖ Γ) ≈ 1 ≈ ∥ u ∥ W 2, p (Ω Γ, ℓ C)$ , $| T ℓ (Γ) | ≈ H ℓ - 1$ and |Ω_Γ,ℓ|≈H_ℓ in this discussion. This leads to a convergence rate of $H ℓ 2 / p$ for the right-hand side of Theorem 5.1. The observed convergence rates of $∥ σ - σ ℓ ∥ L p ′ (Ω)$ and $∥ u - u ℓ ∥ L 2 (Ω)$ for the stabilised benchmark examples in Table 1 show convergence rates beyond those guaranteed in Theorem 5.1.

Theorem 5.3 implies, up to perturbations on the boundary,

∥ D (u - u ℓ) ∥ L 2 (Ω) ≲ ∥ u - u ℓ ∥ L 2 (Ω) 1 / 3 + ∥ | u ℓ ∥ | ℓ + H ℓ - 1 / 2 ∥ | u ℓ ∥ | ℓ 1 / 2 ∥ u - u ℓ ∥ L 2 (Ω) 1 / 2 .

Since the exact solutions of Subsections ‘Two-well benchmark’, ‘An optimal design example’, ‘Three-well benchmark’, and ‘An optimal design example’ are all smooth up to a one-dimensional interface line, Theorem 5.3 applies to these examples. The experiments shows that the right-hand side of Theorem 5.3 is dominated by $H ℓ - 1 / 2 ∥ | u ℓ ∥ | ℓ 1 / 2 ∥ u - u ℓ ∥ L 2 (Ω) 1 / 2$ in all examples and that the inequality is satisfied.

Reliability without regularity assumptions

Up to boundary terms, Theorem 4.1 states

∥ σ - σ ℓ ∥ L p ′ (Ω) 2 + β ∥ u - u ℓ ∥ L 2 (Ω) 2 ≲ η F ∥ u - u ℓ ∥ W 1, p (Ω) .

The convergence rates confirm this assertion for the general and rough estimate $∥ u - u ℓ ∥ W 1, p (Ω) ≲ 1$ in the sense that the rates for η_F are worse than or equal to those of $∥ σ - σ ℓ ∥ L p ′ (Ω) 2$ and $∥ u - u ℓ ∥ L 2 (Ω) 2$ . In the numerical examples, $∥ u - u ℓ ∥ H 1 (Ω)$ is computed and displayed in Table 1 and the convergence rates of the product $∥ u - u ℓ ∥ H 1 (Ω) η F$ can be compared with those of $∥ σ - σ ℓ ∥ L p ′ (Ω) 2 + ∥ u - u ℓ ∥ L 2 (Ω) 2$ . This comparison confirms the above a posteriori error estimate. In the examples with p = 2 (of Subsections ‘Two-well benchmark’, ‘An optimal design example’, ‘Three-well benchmark’, and ‘An optimal design example’), there holds even equality of the convergence rates which demonstrates the efficiency of the estimate of Theorem 4.1.

Efficiency without regularity assumptions

Up to oscillations and the (possibly) higher-order term $∥ (id - I F, ℓ) σ ∥ L q ′ (Ω)$ , Theorem 4.2 states

η F ≲ ∥ σ - σ ℓ ∥ L p ′ (Ω) + β ∥ u - u ℓ ∥ L p ′ (Ω) .

The displayed convergence rates of Table 1 confirm this estimate.

Reliability of the refined a posteriori error control

Theorem 5.4 applies to the example of Subsection ‘Two-well benchmark’ and states

∥ σ - σ ℓ ∥ L p ′ (Ω) 2 + ∥ u - u ℓ ∥ L 2 (Ω) 2 ≲ η L and ∥ D (u - u ℓ) ∥ L 2 (Ω) 2 ≲ η H .

Table 1 confirms this estimate and shows that the estimators η_L and η_H accurately predict the convergence rate of the errors, even with equality of the convergence rates in the case of adaptive mesh refinements in the examples of Subsections ‘Two-well benchmark’, ‘An optimal design example’, ‘Three-well benchmark’, and ‘An optimal design example’.

All displayed convergence rates of η_L are better or at least equal to those of η_F. For instance, for uniform mesh-refining in Subsections ‘Two-well benchmark’, ‘An optimal design example’, ‘Three-well benchmark’, and ‘An optimal design example’, the error terms $∥ σ - σ ℓ ∥ L p ′ (Ω) 2 + ∥ u - u ℓ ∥ L 2 (Ω) 2$ converge with the empirical convergence rate 7/5 while the upper bound η_F does so with a reduced convergence rate 4/5. The refined error estimator η_L is a guaranteed upper bound (via Theorem 5.4) and converges with an empirical convergence rate 1.

Performance of the minimisation algorithm 1

In all numerical experiments of this paper, Algorithm 1 reaches the maximal number 3 of iterations. While this suggests that the optimal s is not found after three iterations, undisplayed experiments with higher iteration counts and hence higher computational efforts result solely in marginal improvements.

Conclusions

Effects of stabilisation

The empirical convergence rates of the error estimators η_F, η_R and the errors $∥ u - u ℓ ∥ L 2 (Ω)$ and $∥ σ - σ ℓ ∥ L p ′ (Ω)$ for uniform mesh-refinement with and without stabilisation coincide. This indicates that the choice γ = 1 leads to some significant perturbation but maintains the correct convergence rate at the same time. This is different for adaptive mesh refinement with less optimal convergence rates. Our conclusion is that an improved adaptive algorithm has to be developed with balance of local mesh-refinement and global stabilisation parameters in future research. The tested algorithm from Subsection ‘Numerical algorithms’ does neither reflect the effects of stabilisation nor that of inexact solve.

Another important aspect of the stabilisation is the regularisation of the Hessian in the step SOLVE of Subsection ‘Numerical algorithms’. In the three-well problem of Subsection ‘Three-well benchmark’, the unstabilised adaptive algorithms fail.

Adaptive versus uniform mesh-refinement

The overall empirical convergence rates of the errors and estimators of the unstabilised computation for adaptive mesh-refinements are better than those for uniform mesh-refinements. This is in contrast to the stabilised computation, where the true errors $∥ σ - σ ℓ ∥ L p ′ (Ω)$ and $∥ u - u ℓ ∥ L 2 (Ω)$ behave better for uniform compared with the two adaptive mesh-refinments (with the exception in Subsection ‘An optimal design example’ where there is equality). It is observed that adaptivity does not necessarily improve the converegnce rates of the error $∥ σ - σ ℓ ∥ L p ′ (Ω)$ and $∥ u - u ℓ ∥ L 2 (Ω)$ in a stabilised computation. Surprisingly, the convergence of the gradient errors $∥ D (u - u ℓ) ∥ L 2 (Ω)$ are slightly improved in the instabilised calculation by adaptive mesh-refinements. The adaptive mesh-refinement is expected to reduce the a posteriori error estimators in the first place: cf. [1, 34] for the estimator reduction property. Indeed, the convergence rates of the a posteriori error estimators η_R, η_F, η_L, η_H are improved (or optimal) for adaptive mesh-refinements (except for the three-well example of Subsection ‘Three-well benchmark’).

Strong convergence of the gradients

The convergence of the gradient error of the stabilised problem surpasses the expectations of [12] in Subsection ‘An optimal design example’ but fails to do so in Subsections ‘Two-well benchmark’, ‘An optimal design example’, ‘Three-well benchmark’, and ‘An optimal design example’. The improved error estimator η_H shows the same convergence rate as the error of the gradients in Subsections ‘Two-well benchmark’, ‘An optimal design example’, ‘Three-well benchmark’, and ‘An optimal design example’. This holds for uniform and for adapted mesh refinements and suggests that η_H is in fact reliable and efficient for β > 0.

Guaranteed error control

The assertion on η_F in Theorem 4.1 is reflected in the numerical examples in that the stress approximations converge faster than η_F in all cases. This suggests that the estimate $∥ u - u ℓ ∥ W 1, p (Ω) ≲ 1$ is by far too pessimistic. In fact, the benchmark examples with known exact solution fulfil $∥ σ - σ ℓ ∥ L 2 (Ω) 2 ≲ η F ∥ u - u ℓ ∥ H 1 (Ω)$ . Similar affirmative conclusions follow for Theorem 4.2 and 5.4.

Reliability-efficiency gap

In comparison with the residual-based error estimator of [7, 18], the new a posteriori error estimators η_L and η_H of Theorem 5.4 lead to refined error control. The improvement is marginal for uniform meshes without stabilisation but significant for adaptive stabilised computations. η_L and η_H match the convergence of the errors and so narrow the reliability-efficiency gap.

References

1.
Carstensen C: Convergence of an adaptive fem for a class of degenerate convex minimisation problems. IMA J Numer Anal 2008,28(3):423–439.
MathSciNet Article Google Scholar
2.
Dacorogna B: Direct methods in the calculus of variations, 2nd Ed. Applied Mathematical Sciences 78. Berlin: Springer; 2008. xii xii
Google Scholar
3.
Carstensen C, Müller S: Local stress regularity in scalar non-convex variational problems. SIAM J Math Anal 2002,34(2):495–509. 10.1137/S0036141001396436
MathSciNet Article Google Scholar
4.
Chipot M: Elements of Nonlinear Analysis. Birkhäuser Advanced Texts. Birkhäuser: Basel; 2000. vi vi
Google Scholar
5.
Müller S: Variational models for microstructure and phase transisions. In Calculus of variations and geometric evolution problems. Lectures given at the 2nd session of the, Centro Internazionale Matematico Estivo (CIME), Cetraro, Italy, June 15–22, 1996, Lect. Notes Math., 1713. Edited by: Hildebrandt S. Berlin: Springer; 1999:85–210.
Google Scholar
6.
Ball JM, James RD: Proposed experimental tests for the theory of fine microstructures and the two-well problem. Phil Trans R Soc Lond A 1992, 338: 389–450. 10.1098/rsta.1992.0013
Article Google Scholar
7.
Carstensen C, Plecháĉ P: Numerical solution of the scalar double-well problem allowing microstructure. Math Comp 1997,66(219):997–1026. 10.1090/S0025-5718-97-00849-1
MathSciNet Article Google Scholar
8.
Bartels S, Carstensen C: A convergent adaptive finite element method for an optimal design problem. Numer Math 2007, 108: 359–385.
MathSciNet Article Google Scholar
9.
Goodman J, Kohn RV, Reyna L: Numerical study of a relaxed variational problem from optimal design. Comput Methods Appl Mech Eng 1986, 57: 107–127. 10.1016/0045-7825(86)90073-3
MathSciNet Article Google Scholar
10.
Carstensen C, Klose R: Guaranteed a posteriori finite element error control for the p-Laplace problem. SIAM J Sci Comput 2003, 25: 792–814. 10.1137/S1064827502416617
MathSciNet Article Google Scholar
11.
Bartels S, Carstensen C, Plecháĉ P, Prohl A: Convergence for stabilisation of degenerate convex minimsation problems. IFB 2004,6(2):253–269.
Google Scholar
12.
Boiger W, Carstensen C: On the strong convergence of gradients in stabilised degenerate convex minimisation problems. SIAM J Numer Anal 2010,47(6):4569–4580. 10.1137/090746409
MathSciNet Article Google Scholar
13.
Ciarlet PG: The finite element method for elliptic problems. Philadelphia, PA, USA: Society for Industrial Mathematics; 2002.
Google Scholar
14.
El Alaoui L, Ern A, Vohralík M: Guaranteed and robust a posteriori error estimates and balancing discretization and linearization errors for monotone nonlinear problems. Comp Meth Appl Mech Eng 2011,200(37–40):2782–2795.
Article Google Scholar
15.
Ern A, Nicaise S, Vohralík M: An accurate h (div) flux reconstruction for discontinuous galerkin approximations of elliptic problems. C R, Math, Acad Sci Paris 2007,345(12):709–712. 10.1016/j.crma.2007.10.036
MathSciNet Article Google Scholar
16.
Luce R, Wohlmuth B: A local a posteriori error estimator based on equilibrated fluxes. SIAM J Numer Anal 2004,42(4):1394–1414. 10.1137/S0036142903433790
MathSciNet Article Google Scholar
17.
Ainsworth M: A synthesis of a posteriori error estimation techniques for conforming, non-conforming and discontinuous galerkin finite element methods. Providence: American Mathematical Society (AMS); 2005.
Google Scholar
18.
Carstensen C, Jochimsen K: Adaptive finite element methods for microstructures? Numerical experiments for a Two-well benchmark. Computing 2003, 71: 175–204. 10.1007/s00607-003-0027-1
MathSciNet Article Google Scholar
19.
Chipot M, Evans LC: Linearisation at infinity and Lipschitz estimates for certain problems in the calculus of variations. Proc Roy Soc Edinburgh Sect A 1986,102(3–4):291–303.
MathSciNet Article Google Scholar
20.
Bartels S, Carstensen C, Dolzmann G: Inhomogeneous Dirichlet conditions in a priori and a posteriori finite element error anylysis. Numer Math 2004,99(1):1–24. 10.1007/s00211-004-0548-3
MathSciNet Article Google Scholar
21.
Knees D: Global stress regularity of convex and some nonconvex variational problems. Ann Mat Pura Appl (4) 2008,187(1):157–184.
MathSciNet Article Google Scholar
22.
Brezzi F, Fortin M: Mixed and hybrid finite element methods. Springer series in computational mathematics. New York: Springer-Verlag; 1991.
Google Scholar
23.
Acosta G, Durán RG: An optimal Poincaré inequality in L¹ for convex domains. Proc Amer Math Soc 2004,132(1):195–202. 10.1090/S0002-9939-03-07004-7
MathSciNet Article Google Scholar
24.
Bergh J, Löfstrom J: Interpolation spaces. Berlin: Springer-Verlag; 1976.
Google Scholar
25.
Brenner SC, Scott LR: The mathematical theory of finite element methods, 2nd Ed. Texts in Applied Mathematics. 15. Berlin: Springer; 2002. p361, xv p361, xv
Google Scholar
26.
Bartels S: Numerical analysis of some non-convex variational problems. Ph.D. thesis. Germany: Christian-Albrechts Universität zu Kiel, Kiel; 2001. [http://eldiss.uni-kiel.de/macau/receive/dissertation_diss_00000519]
Google Scholar
27.
Alberty J, Carstensen C, Funken SA: Remarks around 50 lines of Matlab: short finite element implementation. Numer. Algorithms 1999,20(2–3):117–137.
MathSciNet Article Google Scholar
28.
Repin SI, Sauter S, Smolianski A: A posteriori error estimation for the dirichlet problem with account of the error in the approximation of boundary conditions. Computing 2003,70(3):205–233.
MathSciNet Google Scholar
29.
Carstensen C, Günther D, Rabus H: Mixed finite element method for a degenerate convex variational problem from topology optimization. SIAM J Math Anal 2012,50(2):522–543.
Google Scholar