Lower a posteriori error estimates on anisotropic meshes
Natalia Kopteva

TL;DR
This paper reviews existing lower a posteriori error bounds on anisotropic meshes, demonstrates their limitations, and introduces a new approach that provides sharper bounds for finite element approximations of the Laplace equation.
Contribution
It proposes a novel method to obtain sharper lower a posteriori error bounds on anisotropic meshes, improving the efficiency of error estimation in finite element analysis.
Findings
Standard bounds are not sharp on anisotropic meshes
Numerical example confirms limitations of existing bounds
New approach yields sharper lower error bounds
Abstract
Lower a posteriori error bounds obtained using the standard bubble function approach are reviewed in the context of anisotropic meshes. A numerical example is given that clearly demonstrates that the short-edge jump residual terms in such bounds are not sharp. Hence, for linear finite element approximations of the Laplace equation in polygonal domains, a new approach is employed to obtain essentially sharper lower a posteriori error bounds and thus to show that the upper error estimator in the recent paper [N. Kopteva, Numer. Math., 137 (2017), 607-642] is efficient on certain anisotropic meshes.
| Errors (odd rows) & (even rows) | ||||||||
| 1.01e-1 | 5.04e-2 | 2.52e-2 | 9.00e-1 | 4.52e-1 | 2.27e-1 | |||
| 3.51e-4 | 4.39e-5 | 5.49e-6 | 2.83e-2 | 3.55e-3 | 4.45e-4 | |||
| 1.01e-1 | 5.04e-2 | 2.52e-2 | 9.00e-1 | 4.52e-1 | 2.27e-1 | |||
| 9.74e-5 | 1.22e-5 | 1.52e-6 | 7.86e-3 | 9.86e-4 | 1.23e-4 | |||
| 1.01e-1 | 5.04e-2 | 2.52e-2 | 9.00e-1 | 4.52e-1 | 2.27e-1 | |||
| 2.45e-5 | 3.07e-6 | 3.84e-7 | 1.98e-3 | 2.48e-4 | 3.11e-5 | |||
| 1.01e-1 | 5.04e-2 | 2.52e-2 | 9.00e-1 | 4.52e-1 | 2.27e-1 | |||
| 6.14e-6 | 7.67e-7 | 9.59e-8 | 4.95e-4 | 6.21e-5 | 7.77e-6 | |||
| using (odd rows) & Effectivity Indices (even rows) | ||||||||
| 2.80e-1 | 1.40e-1 | 7.02e-2 | 2.46e+0 | 1.25e+0 | 6.31e-1 | |||
| 2.78 | 2.79 | 2.79 | 2.73 | 2.77 | 2.78 | |||
| 1.30e-1 | 6.51e-2 | 3.26e-2 | 1.14e+0 | 5.82e-1 | 2.93e-1 | |||
| 1.29 | 1.29 | 1.29 | 1.26 | 1.29 | 1.29 | |||
| 6.24e-2 | 3.13e-2 | 1.57e-2 | 5.46e-1 | 2.80e-1 | 1.41e-1 | |||
| 0.62 | 0.62 | 0.62 | 0.61 | 0.62 | 0.62 | |||
| 3.09e-2 | 1.55e-2 | 7.74e-3 | 2.71e-1 | 1.38e-1 | 6.95e-2 | |||
| 0.31 | 0.31 | 0.31 | 0.30 | 0.31 | 0.31 | |||
| using (odd rows) & Effectivity Indices (even rows) | ||||||||
| 3.81e-1 | 1.91e-1 | 9.55e-2 | 3.34e+0 | 1.71e+0 | 8.58e-1 | |||
| 3.79 | 3.79 | 3.79 | 3.71 | 3.77 | 3.79 | |||
| 3.51e-1 | 1.76e-1 | 8.79e-2 | 3.06e+0 | 1.57e+0 | 7.90e-1 | |||
| 3.48 | 3.49 | 3.49 | 3.40 | 3.47 | 3.49 | |||
| 3.48e-1 | 1.74e-1 | 8.73e-2 | 3.04e+0 | 1.56e+0 | 7.84e-1 | |||
| 3.46 | 3.46 | 3.47 | 3.38 | 3.44 | 3.46 | |||
| 3.48e-1 | 1.74e-1 | 8.72e-2 | 3.04e+0 | 1.56e+0 | 7.84e-1 | |||
| 3.46 | 3.46 | 3.46 | 3.38 | 3.44 | 3.46 | |||
| Errors | |||||||
| 1.66e-2 | 1.60e-1 | 1.74e+0 | 2.51e-7 | 2.79e-5 | 2.67e-3 | ||
| 8.30e-3 | 8.01e-2 | 8.73e-1 | 3.13e-8 | 3.49e-6 | 3.34e-4 | ||
| using | Effectivity Indices | ||||||
| 3.68e-2 | 2.30e-1 | 1.48e+0 | 2.22 | 1.44 | 0.85 | ||
| 1.84e-2 | 1.15e-1 | 7.47e-1 | 2.22 | 1.44 | 0.86 | ||
| using | Effectivity Indices | ||||||
| 5.76e-2 | 5.55e-1 | 5.92e+0 | 3.47 | 3.46 | 3.40 | ||
| 2.88e-2 | 2.78e-1 | 3.01e+0 | 3.47 | 3.47 | 3.45 | ||
| Errors | |||||||
| 2.29e-1 | 1.14e-1 | 5.72e-2 | 7.17e-5 | 8.97e-6 | 1.12e-6 | ||
| 6.67e-1 | 3.34e-1 | 1.67e-1 | 4.29e-4 | 5.36e-5 | 6.71e-6 | ||
| 1.90e+0 | 9.59e-1 | 4.80e-1 | 2.49e-3 | 3.12e-4 | 3.90e-5 | ||
| using (odd rows) | Corresponding (odd rows) | ||||||
| Effectivity Indices (even rows) | (even rows) | ||||||
| 7.59e-1 | 3.80e-1 | 1.90e-1 | 6.16e-2 | 3.09e-2 | 1.54e-2 | ||
| 3.32 | 3.32 | 3.32 | 0.08 | 0.08 | 0.08 | ||
| 2.19e+0 | 1.10e+0 | 5.50e-1 | 1.31e-1 | 6.61e-2 | 3.31e-2 | ||
| 3.28 | 3.29 | 3.29 | 0.06 | 0.06 | 0.06 | ||
| 6.20e+0 | 3.13e+0 | 1.57e+0 | 2.67e-1 | 1.36e-1 | 6.82e-2 | ||
| 3.26 | 3.27 | 3.27 | 0.04 | 0.04 | 0.04 | ||
| using (odd rows) | Corresponding (odd rows) | ||||||
| Effectivity Indices (even rows) | (even rows) | ||||||
| 7.96e-1 | 3.98e-1 | 1.99e-1 | 2.46e-1 | 1.24e-1 | 6.18e-2 | ||
| 3.48 | 3.48 | 3.48 | 0.31 | 0.31 | 0.31 | ||
| 2.31e+0 | 1.16e+0 | 5.80e-1 | 7.43e-1 | 3.74e-1 | 1.87e-1 | ||
| 3.46 | 3.47 | 3.47 | 0.32 | 0.32 | 0.32 | ||
| 6.55e+0 | 3.31e+0 | 1.66e+0 | 2.14e+0 | 1.09e+0 | 5.46e-1 | ||
| 3.44 | 3.46 | 3.46 | 0.33 | 0.33 | 0.33 | ||
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
11institutetext: N. Kopteva 22institutetext: Department of Mathematics and Statistics, University of Limerick, Limerick, Ireland
22email: [email protected]
Lower a posteriori error estimates
on anisotropic meshes††thanks: The author was partially supported by Science Foundation Ireland grant SFI/12/IA/1683.
Natalia Kopteva
Abstract
Lower a posteriori error bounds obtained using the standard bubble function approach are reviewed in the context of anisotropic meshes. A numerical example is given that clearly demonstrates that the short-edge jump residual terms in such bounds are not sharp. Hence, for linear finite element approximations of the Laplace equation in polygonal domains, a new approach is employed to obtain essentially sharper lower a posteriori error bounds and thus to show that the upper error estimator in the recent paper Kopt_NM_17 is efficient on partially structured anisotropic meshes.
Keywords:
Anisotropic triangulation Lower a posteriori error estimate Estimator efficiency
MSC:
65N15 65N30
1 Introduction
The purpose of this paper is to address the efficiency of a posteriori error estimators on anisotropic meshes, which essentially reduces to obtaining sharp lower a posteriori error bounds. For shape-regular meshes such lower error bounds can be found in AinsOd_2000 ; Ver_book_13 . For anisotropic meshes, the situation is more delicate, as we shall now elaborate.
For unstructured anisotropic meshes, both upper and lower a posteriori error estimates were obtained in Kunert2000 ; Kun01 ; KunVer00 for the Laplace equation and for a singularly perturbed reaction-diffusion equation; see also (Ver_book_13, , §4.5). We also refer the reader to Mich_Perrotto , where the reliability and efficiency of a residual-type estimator from Picasso_2003 based on the Zienkiewicz-Zhu recovery procedure was established on anisotropic meshes under an % superconvergence type condition (explained, e.g., in (AinsOd_2000, , §4.8)). It should be noted that although the lower error bounds in Kunert2000 ; Kun01 ; KunVer00 involve the same estimators as the corresponding upper bounds, however the error constants in the upper bounds include the so-called matching functions. The latter depend on the unknown error and take moderate values only when the mesh is either isotropic, or, being anisotropic, is aligned correctly to the solution, while, in general, they may be as large as mesh aspect ratios.
The presence of such matching functions in the estimator is clearly undesirable. It is entirely avoided in the more recent papers Kopt15 ; Kopt_NM_17 ; Kopt17 , where upper a posteriori error estimates on anisotropic meshes were obtained for singularly perturbed semilinear reaction-diffusion equations in the energy norm and in the maximum norm.
Interestingly, the efficiency of the estimators in Kopt15 ; Kopt_NM_17 ; Kopt17 cannot be established using the standard bubble function approach, employed in Kunert2000 ; Kun01 ; KunVer00 . To be more precise, this approach (which will be reviewed in §2) leads to lower error bounds with significantly smaller weights at the short-edge jump residual terms than those in the upper bounds.
The main findings of the present paper are as follows.
- •
Lower a posteriori error bounds obtained using the standard bubble function approach, such as in Kunert2000 ; Kun01 ; KunVer00 , will be reviewed in the context of anisotropic meshes. Numerical examples will be given in §2 that clearly demonstrate that the short-edge jump residual terms in such bounds are not sharp.
- •
Hence, we shall present a new approach that yields essentially sharper lower a posteriori error bounds and thus shows that the upper error estimator in Kopt_NM_17 is efficient on partially structured anisotropic meshes.
Note that mild restrictions on the structure of the mesh are not uncommon in the literature when, for example, recovery type a posterior error estimators are considered xu_Zhang , and, as discussed in §5.1, such restrictions are not unreasonable when an anisotropic mesh is generated starting from a regular mesh.
Compared to Kopt15 ; Kopt_NM_17 ; Kopt17 , to simplify the presentation, we shall restrict the consideration to the simpler Laplace equation and consider the problem
[TABLE]
posed in a, possibly non-Lipschitz, polygonal domain . We also assume that (for a less smooth , see Remarks 2.2 and 4.3).
Linear finite element approximations of (1.1) will be considered. Let be a piecewise-linear finite element space relative to a triangulation , and let the computed solution satisfy
[TABLE]
where denotes the inner product.
To give an idea of the results in Kopt_NM_17 , under the assumptions on the mesh described in §3, one upper error estimate reduces to (Kopt_NM_17, , Theorems 6.1 and 7.4)
[TABLE]
where is independent of the diameters and the aspect ratios of elements in . Here is the set of edges in , is the standard jump in the normal derivative of across any interior edge , and is the patch of two elements sharing . We also use , which may be significantly larger than , and the standard piecewise-linear Lagrange interpolant of .
Furthermore, under some additional assumptions on the orientation of mesh elements surrounding sequences of anisotropic nodes connected by short edges, a sharper upper estimator was obtained in (Kopt_NM_17, , Theorem 6.2):
[TABLE]
To relate (1.3) and (1.4) to interpolation error bounds, as well as to possible adaptive-mesh construction strategies, note that may be interpreted as approximating the diameter of under the metric induced by the squared Hessian matrix of the exact solution (while approximates ).
Our task in this paper will be to establish the efficiency of the upper estimator in (1.4) up to data oscillation. As was already mentioned, the standard bubble function approach yields unsatisfactory lower bounds, with the weight at (rather than a simpler and more natural in (1.4)). Remark 2.4 sheds some light on our approach to remedying this.
The paper is organized as follows. In §2, we review lower a posteriori error bounds obtained using the standard bubble function approach. In particular, numerical examples are given that demonstrate that the short-edge jump residual terms in such bounds are not sharp. The remainder of the paper is devoted to obtaining sharper lower error bounds In §3, we describe basic triangulation assumptions. Then in §4, we present a version of the analysis for partially structured meshes, while the case of more general anisotropic meshes is addressed in §5.
Notation. We write when and , and when with a generic constant depending on and , but not on the diameters and the aspect ratios of elements in . Also, for and , let and , and also for . Whenever quantities such as or appear in volume integrals or related norms, or appears in line integrals or related norms, they are understood as piecewise-constant functions.
2 Standard lower error bounds are not sharp on anisotropic meshes
This section is devoted to lower error bounds, such as in Kunert2000 ; Kun01 ; KunVer00 , obtained using the standard bubble function approach. Numerical examples will be given in §2.1 that clearly demonstrate that the short-edge jump residual terms in such bounds are not sharp. These examples also suggest that the jump residual terms in our upper estimators (1.3) and (1.4) have correct weights (the efficiency of the latter will be theoretically justified in §§4-5). Furthermore, in §2.2, we shall review the bubble function approach when applied to anisotropic meshes and discuss its deficiencies with a view of changing the paradigm for deriving upper bounds for jump residuals associated with short edges (in particular, see Remarks 2.3 and 2.4).
2.1 Numerical examples
Our first test problem is (1.1) with the exact solution (for ) and the corresponding in . We employ the triangulation obtained by drawing diagonals from the tensor product of the uniform grids and in the - and -directions respectively (with all diagonals having the same orientation). A standard quadrature with replaced in (1.2) by its Lagrange interpolant will be used in numerical experiments.
For this problem, we compare two lower error estimates: obtained using the standard bubble function approach KunVer00 (see also Lemma 2.1 in §2.2) and the one obtained in §4 (see Theorem 4.1). They can be described by
[TABLE]
(To be more precise, when is used, the term in the right-hand side of (2.1a) should be replaced by a larger ; see §4 for details.) Importantly, the choice , which will be theoretically justified in §§4-5, is consistent with the jump residual terms in our upper error estimates (1.3) and (1.4).
To address whether the lower error estimator in (2.1a) is sharp, the errors (as well as ) are compared with in Table 1. (In these computations and are replaced, respectively, by their piecewise-linear and piecewise-quadratic interpolants.)
Clearly, the standard lower estimator with is not sharp. Not only its effectivity indices strongly depend on the ratio , but, perhaps more alarmingly, converges to zero as increases, i.e. when the mesh is anisotropically refined in the wrong direction (while the error remains almost independent of ). By contrast, the estimator of §4, with , performs quite well, with the effectivity indices stabilizing.
When comparing the two estimators, note that their weights are similar when ; however, they become dramatically different when , i.e. for short edges. Hence, our numerical experiments clearly suggest that it is the short-edge jump residual terms in the standard lower error estimator that are not sharp.
Next, consider a two-scale exact solution with , which exhibits a boundary layer in variable and smaller-scale oscillations in variable . To simplify the setting, we consider a version of problem (1.1) with this exact solution only in the boundary-layer domain , with the corresponding and Dirichlet boundary conditions. The two lower estimators from (2.1) are compared in Table 2 on the mesh constructed similarly to the first test problem, with , only now the 1d grid in the -direction is . Thus, the mesh is correctly adapted in the -direction, but ignores the oscillations in the -direction, i.e. it is anisotropic, but incorrectly aligned. As takes smaller values, the errors increase, which is not adequately detected by the estimator with , the effectivity indices of which deteriorate (although more moderately than in Table 1; see Remark 2.1 for further discussion). The estimator with again performs quite well, with all effectivity indices close to .
Finally, in Table 3, the two estimators are tested for a one-scale exact solution on the anisotropic mesh which is incorrectly aligned in the -direction only. To simplify the setting, we again consider a version of (1.1) in and use . As discussed in Remark 2.1 below, both estimators exhibit stable effectivity indices. However, the bulk contribution of the short-edge residuals, computed as \mathring{{\mathcal{E}}}:=\bigl{\{}\sum_{S\in\mathring{\mathcal{S}}}\varrho_{S}\,|\omega_{S}|J_{S}^{2}\bigr{\}}^{1/2} with \mathring{S}:=\bigl{\{}|S|<\frac{1}{2}{\rm diam}(\omega_{S})\bigr{\}}, becomes negligible for (unlike the case ). This is undesirable, as may lead to the erroneous interpretation that the mesh is aligned correctly and possibly requires further refinement only in the -direction. (As here we compare with the overall estimator , it is important to note for the component of that was for the first estimator and , and did not exceed in all other computations for this problem.)
Remark 2.1
From the point of view of interpolation, if the anisotropic elements are aligned in the -direction, roughly speaking, one may expect that gives an approximation to for long edges and for short edges, where and are the mesh sizes respectively in the - and -directions. In all our computations . For the first test problem, , which explains why the contributions of the short-edge residuals with correct weights are crucial for the overall efficiency of the estimator. In our second test, is dominated by , but not as significantly, which is reflected in a more moderate deterioration of the estimator efficiency whenever for short edges. For the final test, , so takes similar in magnitude values for short and long edges; hence, even when the bulk contribution of short-edge residuals is almost nullified by , the overall estimator efficiency remains adequate.
2.2 Lower error bounds using the standard bubble approach
Here, for completeness, and with a view of motivating the new approach of §§4-5, we prove a version of the lower error bound from (KunVer00, , Theorem 5.1); see also (Ver_book_13, , Theorem 4.37). Similar bounds can also be found in (Kunert2000, , Theorem 2) for the 3d case, and in (Kun01, , Theorem 4.3) for a singularly perturbed equation; see also (Ver_book_13, , §4.5). Note also that Lemma 2.1 below gives a version of the lower error bounds from (Kun01, , Theorem 4.3), while in the earlier literature the weight in the bounds of type (2.2b) was replaced by the smaller .
Lemma 2.1
Let satisfy the maximum angle condition, and let , . Then for a solution of (1.1) and any , one has
[TABLE]
Proof
(i) On any , consider , where are the standard hat functions associated with the three vertices of . Now, a standard calculation yields . Note also that, in view of (1.1) and also on , one has . Next, invoking , one arrives at
[TABLE]
The first desired result (2.2a) follows in view of .
(ii) For each of the two triangles , introduce a triangle with an edge such that . Next, set w:=J_{S}\,\color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\widetilde{\phi}_{1}\widetilde{\phi}_{2}, where \color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\widetilde{\phi}_{1} and \color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\widetilde{\phi}_{2} are the hat functions associated with the end points of on the obtained triangulation (with on each for ). A standard calculation using in and (1.1), yields
[TABLE]
Next, invoking for any , we arrive at
[TABLE]
where denotes the right-hand side of (2.2a), and the latter bound was also employed for the estimation of . The second desired bound (2.2b) follows in view of .
Remark 2.2
The piecewise-linear Lagrange interpolant of used in (2.2) may be replaced by any, possibly discontinuous, quasi-interpolant of (such as the piecewise-constant approximation of by its element average values).
Remark 2.3 (Deficiency of the bubble function approach)
An inspection of the above proof shows that it is sharp in the sense that it cannot be tweaked to remove the weight in (2.2b); see also Appendix A. More precisely, for such an improvement, one would need in (2.3), which is not the case for short edges.
Remark 2.4 (Preview of the new approach)
The bubble function in the proof of (2.2b) may be viewed as a simplest local cut-off function. However, in the case of anisotropic mesh elements, its gradient is not consistent with the diameter of the local patch. To remedy this, when dealing with short edges in §§4-5 below, we shall switch to a cut-off function, the support of which comprises a larger local patch of anisotropic elements (rather than a two-triangle patch) and has an interior diameter . (Such local patches are highlighted in grey in Fig. 1 (left) and Fig. 2.) Unsurprisingly, this approach brings new challenges. For example, we have to deal with multiple edges inside this larger patch; in particular, we need to find a way to (almost) eliminate the jump residuals associated with the long edges. But this change of the paradigm will lead to essentially sharper lower error bounds of type (2.1a) with .
3 Basic triangulation assumptions
In the remainder of the paper, we shall use , and to denote particular mesh nodes, edges and elements, respectively, while , and will denote their respective sets. For each , let be the patch of elements surrounding , the set of edges originating at , and
[TABLE]
Throughout the paper we make the following triangulation assumptions.
- •
Maximum Angle condition. Let the maximum interior angle in any triangle be uniformly bounded by some positive .
- •
Local Element Orientation condition. For any , there is a rectangle such that .
- •
Also, let the number of triangles containing any node be uniformly bounded.
Note that the above conditions are automatically satisfied by shape-regular triangulations.
Additionally, we restrict our analysis to the following two node types defined using a fixed small constant (to distinguish between anisotropic and isotropic elements), with the notation for .
(1) Anisotropic Nodes, the set of which is denoted by , are such that
[TABLE]
Note that the above implies that contains at most two edges of length (see also Fig. 2).
(2) Regular Nodes, the set of which is denoted by , are those surrounded by shape-regular mesh elements.
The above imposes a gradual transition between anisotropic and isotropic elements, i.e. the set is not necessarily empty. (To simplify the presentation, here we exclude more general node types, such as in Kopt15 ; Kopt_NM_17 ; Kopt17 , with both anisotropic and isotropic mesh elements allowed to appear within the same patch .)
Next, recall that is the patch of two elements sharing , and introduce the set of short edges
[TABLE]
Remark 3.1
By Lemma 2.1, one has \bigl{\{}\sum_{S\subset{\mathcal{D}}\backslash\mathring{\mathcal{S}}}|\omega_{S}|J_{S}^{2}+\|h_{T}\,f^{I}\|_{\mathcal{D}}\bigr{\}}^{1/2}\lesssim{\mathcal{Y}}_{{\mathcal{D}}}. Indeed, this follows from (2.2) combined with , where denotes the right-hand side of (2.2a). Hence, for , it suffices to prove that .
4 Estimator efficiency on a partially structured anisotropic mesh
4.1 Lower error bound on a partially structured anisotropic mesh
To illustrate our approach in a simpler setting, we first present a version of the analysis for a simpler, partially structured, anisotropic mesh in a square domain . So, throughout this section, we make the following triangulation assumptions.
- A1.
Let be an arbitrary mesh on the interval in the direction. Then, let each , for some ,
(i) have the shortest edge on the line segment ;
(ii) have a vertex on or (see Fig. 1, left). 2. A2.
Let , i.e. each mesh node satisfies (3.1). 3. A3.
Global Element Orientation condition. For any , there is a rectangle with sides parallel to the coordinate axes such that .
These conditions essentially imply that all mesh elements are anisotropic and aligned in the -direction.
Theorem 4.1
Let and solve, respectively, (1.1) and (1.2) under conditions A1–A3. Then in , using the notation (3.2), one has
[TABLE]
The remainder of this section will be devoted to the proof of this result.
Corollary 4.2
Under the conditions of Theorem 4.1, with and defined using and , one has
[TABLE]
Proof
Combining (4.1) with (as there are no short edges in ) and Remark 3.1, we conclude that . The final bound follows.
Remark 4.1 (Estimator efficiency)
It follows from (Kopt_NM_17, , Theorems 5.1 and 7.4) that if , then . Comparing this upper error bound with from Corollary 4.2, we conclude that the error estimator is efficient up to data oscillation.
4.2 Preliminary results for partially structured meshes
The following result will be useful in the proof of Theorem 4.1.
Lemma 4.3
(i) If for some , with formed by the two edges and , then
[TABLE]
(ii) If for some , with formed by a single edge , then (4.2) holds true with replaced by [math].
Proof
(i) As , so , where denotes the jump in across any edge in evaluated in the anticlockwise direction about . Multiplying this relation by the unit vector in the -direction, and noting that , one gets the desired assertion. Here we also use the observation that for , one has , where is a unit normal vector to , for which A3 implies .
(ii) Now , so extend to by [math] and imitate the above proof with the modification that now . When dealing with the two edges on , note that for , one gets .
Corollary 4.4
Under the conditions of Lemma 4.3, one has
[TABLE]
where is from (3.2a), and if , then in (4.3) is replaced by [math].
Proof
In view of (4.2), the left-hand side in (4.3) is , where we also used . Next, note that the set of edges can be described as , so, by Remark 3.1, the desired assertion follows.
Remark 4.2
The minimal rectangle from condition A3 is defined by , where is the range of within . For this rectangle, the above conditions (in particular A3) imply that . Furthermore, there is such that , where , and denotes the patch of elements in/touching . This conclusion is illustrated on Fig. 1 (right). (Note that if our partially structured triangulation is non-obtuse.)
4.3 Proof of Theorem 4.1
Proof
Throughout the proof we shall use the somewhat simplified notation and , and also will frequently drop the index and write , and \color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}H:=H_{i}:=\frac{1}{2}(x_{i+1}-x_{i-1}). With this notation, , so, taking into consideration the structure of the mesh (see Fig. 1, left), (3.2c) and (3.2a) with can be rewritten as
[TABLE]
Next, note that for any and , a standard calculation using (1.1), (1.2) yields
[TABLE]
As this immediately implies , it suffices to prove that
[TABLE]
The desired assertion (4.1) will indeed follow, in view of with a sufficiently small positive constant .
The remainder of the proof is split into three parts. In part (i), we shall describe appropriate non-standard and , which will be crucial for (4.6) to hold true. Certain sufficient conditions for the latter will be established in part (ii), and then shown to be satisfied in part (iii).
(i) Crucially, in (4.5), we require that and both have support in and satisfy
[TABLE]
Note that , which appears in the definition of nodal values of , includes exactly two short edges, while, to be more precise, has support in {\color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\hat{\Omega}_{i}}:=(x_{i-1/2},x_{i+1/2})\times(0,1)\subset\Omega_{i}.
(ii) We claim that for (4.6), and hence for the desired assertion (4.1), it suffices to prove that the following conditions are satisfied:
[TABLE]
Indeed, for from (4.5), by (4.4), one immediately has . Here, by (4.7), , for which we have (4.8b). Combining these observations, one gets the desired bound on in (4.6).
Next, for from (4.5), set \hat{f}(x,y):=f(x_{i}+{\color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}2}[x-x_{i}],y) (similarly to in (4.7)). Then , so
[TABLE]
Here we also used (in view of (4.7)), while the bound on \|f-\hat{f}\|_{2\,;\color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\hat{\Omega}_{i}} follows from Remark 4.2. Combining the above with (in view of (4.4)) and the bound in (4.8b) on yields the desired bound on in (4.6).
Finally, consider , the most delicate term in (4.5). To check that the corresponding bound in (4.6) follows from (4.8), note that in each triangle , one has , so . Note also that on , so . It also follows from (4.7) that on . Combining these observations, one gets
[TABLE]
Now, subtracting (in view of (4.4)) yields
[TABLE]
So, using (4.4) for the first term, and (4.8a) combined with Remark 4.2 for the second, one gets
[TABLE]
When dealing with the second term, we also used for any edge originating at . For the first term in (4.11), in view of (4.7), , where the latter bound follows from (4.8c) combined with and . The second term in (4.11) is bounded by , where we used Remark 3.1 and (4.8b). Combining these findings yields the desired bound on in (4.6).
(iii) To complete the proof, it remains to establish the three bounds on in (4.8). To establish (4.8a), for any starting at , let , the projection of onto the line . Then, by (4.7), . On the other hand, by A3, one has \Bigl{|}\int_{S}v_{h}-\frac{|S|}{|S^{\prime}|}\int_{S^{\prime}}v_{h}\Bigr{|}\lesssim\|\partial_{y}v_{h}\|_{1\,;\omega_{z}^{*}} and a similar bound on (see, e.g., (Kopt_NM_17, , Lemma 7.1)). Combining these observations, and also noting that , yields (4.8a).
For (4.8b), first, note that has support in , so , where we used (4.7) and then (4.4). Furthermore, . So it remains to bound , for which we note that on any having an edge (while otherwise ). Assuming that (4.8c) is true, one then gets . Combining our findings, we conclude that (4.8b) follows from (4.8c).
Finally, to establish (4.8c), recall (4.3) and combine it with the definition of in (4.7) and the observation that .
Remark 4.3 (Non-smooth )
An inspection of the above proof shows that (4.1) remains valid if in , which appears in the right-hand side, the term is replaced by , where is an arbitrary function of variable . To be more precise, the bound (4.9) for can be replaced by . Additionally, we use a sharper version of the bound (4.3), with in the right-hand side term replaced by . (This version of (4.3) holds true as a similar improvement applies to the bound of Remark 3.1.) Note that if , then may be chosen equal to a 1d local average of , and if , then may be piecewise-constant with local 2d average values, while may be a quasi-interpolant described in Remark 2.2.
5 Estimator efficiency on more general meshes
5.1 Main result
Under the triangulation assumptions of §3, each anisotropic node shares the local patch orientation with its anisotropic neighbours. So it is not unreasonable to expect that an anisotropic mesh may include small clusters of anisotropic elements sharing the same orientation. In fact, (in particular, if a locally anisotropic mesh was generated starting from some regular mesh) one may assume that the entire anisotropic part of the mesh can be split into sufficiently large, and possibly overlapping, clusters of anisotropic elements with interior cluster diameters .
Hence, in this section, lower error bounds will be given for small patches of elements surrounding what will be called a local anisotropic path (also see Fig. 2 (left)).
Definition. A Local Anisotropic Path is a simple polygonal curve formed by a subset of short edges, together with their endpoints, that does not touch any corners of , has 2 endpoints (the set of the latter is denoted ), and satisfies the following conditions:
- •
Any node is anisotropic in the sense (3.1) and satisfies for some associated with , and also (so is formed by at most two short edges).
- •
Path Element Orientation condition. There exists a path-specific cartesian coordinate system such that for any node , there is a rectangle with sides parallel to the coordinate axes and .
Theorem 5.1** (Short-edge jump residual terms)**
Suppose that , where and are local anisotropic paths that share a coordinate system , and also and . Then for and satisfying respectively (1.1) and (1.2), with the notation (3.2), one has
[TABLE]
The remainder of this section is devoted to the proof of this result.
Corollary 5.2
Under the conditions of Theorem 5.1, one has
[TABLE]
Proof
As (5.1) is equivalent to , combining the latter with Remark 3.1 immediately yields the desired result.
Remark 5.1 (Estimator efficiency)
It follows from (Kopt_NM_17, , §6.1 and Theorem 7.4) that under conditions on the mesh described in §3 and some additional assumptions on the orientation of anisotropic mesh elements, the error bound (1.4) holds true, i.e. . Note that for any regular node , (2.2) yields a standard bound . Now, suppose that all anisotropic nodes in can be split into disjoint sets, each forming a local anisotropic path of type in Theorem 5.1,
and any node in belongs to at most a finite number of the respective paths of type .
Then, in view of Corollary 5.2, one gets , i.e. the error estimator is efficient up to data oscillation.
Remark 5.2 (Singular perturbation case)
Note that the upper a posteriori error bounds in Kopt_NM_17 were obtained for more general singularly perturbed semilinear reaction-diffusion equations, solutions of which typically exhibit sharp boundary and interior layers, so anisotropic meshes are frequently employed in their numerical solution. With regard to the lower error bounds for such equations, the standard bubble-function approach was employed in Kun01 , and, as was shown in §2, the resulting estimates are not sharp even in the regular regime. Sharper lower bounds of type (5.1) will be generalized to this case in a forthcoming paper.
5.2 Preliminary results for a local anisotropic path
To prove Theorem 5.1, we shall use a version of Lemma 4.3, in which we shall consider the normalized version of defined by
[TABLE]
Here is a local anisotropic path associated with the coordinate system , is the unit vector in the -direction, and is a unit vector normal to , while follows from being a short edge and the path element orientation condition. It may be helpful to note that equals a signed jump of across .
Lemma 5.3
*Let be a local anisotropic path associated with the coordinate system , and from (5.2).
(i) For any node , with formed by two edges and ,*
[TABLE]
(ii) If , with formed by a single edge , then (5.3) holds true with replaced by [math].
Proof
(i) As , so , where denotes the jump in across any edge in evaluated in the anticlockwise direction about . Multiply this relation by the unit vector in the -direction, and note that the quantities for have opposite signs (in view of the path element orientation condition combined with the maximum angle condition), so . Note also that for , one has and (again, in view of the path element orientation condition combined with the maximum angle condition), so . Combining theses observations yields the desired assertion (5.3).
(ii) Now , and is not a corner of . First, suppose that is parallel to the -axis. Then extend to by [math] and imitate the above proof with the modification that now . When dealing with the two edges on , note that for , one gets .
Finally, suppose is not parallel to the -axis; then introduce a -axis parallel to . Now the above argument yields a version of (5.3) with replaced by . The desired result follows as . The latter follows from , in view of the path element orientation condition combined with the maximum angle condition.
Corollary 5.4
Under the conditions of Lemma 5.3, one has
[TABLE]
where is from (3.2a), and if , then in (5.4) is replaced by [math].
Proof
Imitate the proof of Corollary 4.4.
Remark 5.3
Similarly to the case of a partially structured mesh (see Remark 4.2 and Fig. 1 (right)), there is such that each rectangle from the above path element orientation condition satisfies for all .
5.3 Proof of Theorem 5.1
We generalize the proof of Theorem 4.1.
Proof
Without loss of generality, let such that and (see Fig. 2). Also, to simplify the presentation, let the -axis be parallel to at (otherwise, see Remark 5.4).
Set . A certain weight will be associated with each , and it will be imposed that . Hence, it suffices to prove that
[TABLE]
where is from (5.2). Then, indeed, in view of and , (5.5) immediately implies the desired assertion (5.1).
Next, note that for any and , a standard calculation using (1.1), (1.2) yields
[TABLE]
As this immediately implies , to get (5.5) (and hence the desired assertion (5.1)), it suffices to prove that
[TABLE]
The remainder of the proof is split into three parts. In part (i), we shall describe appropriate weights and non-standard functions and , which will be crucial for (5.7) to hold true. Certain sufficient conditions for the latter will be established in part (ii), and then shown to be satisfied in part (iii).
(i) We start by introducing a smooth monotone cut-off function of the arc-length parameter of such that
[TABLE]
Here for the final relation, recall that and let be quadratic near its zeros.
Next, introduce
[TABLE]
where is from (5.2) (and also appears in (5.5)), and denotes the patch of (at most three) edges in touching (so ).
Finally, in (5.6), we let , with support in , and satisfy
[TABLE]
Here the function describes the curve for the range of in , and is constant outside this range. Without loss of generality, , so has support in \color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\omega_{{\mathcal{P}}}. (Otherwise, in view of Remark 5.3, shorten by short edges starting from , where .)
For in (5.10), note that (in view of the path element orientation condition combined with the maximum angle condition). This observation implies that is well-defined in , and , as well as .
Note also a few useful properties, which follow from (5.9) and (5.10):
[TABLE]
To check (5.11a), note that is linear on , so is between and , so this assertion follows. For (5.11b), we note that for any , so . Finally, , where , one has , so . Here , while the final relationship in (5.8) yields (where we also used as is monotone).
(ii) We claim that for (5.7), and hence for the desired assertion (5.1), it suffices to prove that the following conditions (which give a version of (4.8)) are satisfied:
[TABLE]
Note that and are shown to satisfy (5.7) using (5.12) in a very similar manner to the corresponding bounds in part (ii) of the proof of Theorem 4.1, only for we now employ \hat{f}:=f\bigl{(}{\color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\bar{\xi}_{{\mathcal{P}}}(\eta)+2[\xi-\bar{\xi}_{{\mathcal{P}}}(\eta)]},\eta\bigr{)} and then Remark 5.3.
To show that also satisfies (5.7), first, we get a version of (4.10) with replaced by . Next, subtracting \frac{1}{2}H^{-1}{{\widetilde{\mathcal{E}}}}_{{\mathcal{P}}}^{2}=\frac{1}{2}\sum_{S\subset{\mathcal{P}}}{\color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}|S|}\rho_{S}J_{S}J^{\prime}_{S} (in view of the definition of in (5.5)) yields
[TABLE]
So, using the definition of combined with for the first term, and combined with Remark 5.3 for the second, one gets
[TABLE]
When dealing with the second term, we also used for any edge originating at . For the first term in (5.13), , which follows from (5.12c) combined with and . The second term in (5.13) is bounded by , where we used Remark 3.1 and (5.12b). Combining these findings yields the desired bound on in (5.7).
(iii) To complete the proof, it remains to establish the three bounds on in (5.12). The first bound (5.12a) is obtained similarly to (4.8a). Only now for any starting at , we use , the projection of onto the line , and also .
For (5.12b), first, note that with support in , so , where we used (5.11b) and also the definition of in (5.5). Furthermore, on any one has , so
[TABLE]
Here , while assuming that (5.12c) is true. Combining our findings, we conclude that (5.12b) follows from (5.12c).
Finally, (5.12c) is obtained similarly to (4.8c). To be more precise we recall (5.4) and combine it with the definition of in (5.9) and the observation that .
Remark 5.4
If in the proof of Theorem 5.1 is such that the -axis is not parallel to at , then one needs to tweak the definition of so that its support is in (rather than in ). This modification is required to ensure that has support in \color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\omega_{{\mathcal{P}}}. For this, remains unchanged (i.e. equal to ) on near , while we now set for any . Note that the evaluations will remain without major changes as includes a finite number of edges (in view of Remark 5.3), so for the edge closest to will involve , the estimation of which will require a finite number of applications of (5.4).
6 Conclusion
We have reviewed lower a posteriori error bounds obtained using the standard bubble function approach in the context of anisotropic meshes. Numerical examples have been given in §2 that clearly demonstrate that the short-edge jump residual terms in such bounds are not sharp. Hence, in §§4–5, for linear finite element approximations of the Laplace equation in polygonal domains, a new approach has been presented that yields essentially sharper lower a posteriori error bounds and thus shows that the upper error estimator (1.4) from the recent paper Kopt_NM_17 is efficient on partially structured anisotropic meshes.
Appendix A Generalized proof of (2.2b) for the case
The purpose of this section is to illustrate Remark 2.3 by giving a more general version of the proof of (2.2b) in Lemma 2.1, which shows that the latter proof cannot be tweaked to remove the weight in (2.2b).
Proof of (2.2b) for the case . As (2.2b) is obtained in part (ii) of the proof of Lemma 2.1, we generalize only this part. Also, we shall consider only the case . Hence, in view of the conditions of Lemma 2.1, one has .
(ii) For each of the two triangles , introduce a triangle with an edge such that . In the original proof, we used , while now, to allow more flexibility, it is assumed that .
Next, set , where and are the hat functions associated with the end points of on the obtained triangulation (with on each for ). A standard calculation using in and (1.1), yields
[TABLE]
Next, invoking for any , we arrive at
[TABLE]
Finally, a calculation using yields
[TABLE]
To minimize the weight at in the right-hand side, one needs , i.e. as in the original proof of (2.2b)! Hence, we get (2.2b) with the same, i.e. unimproved, weights.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1(1) Ainsworth, M., Oden, J. T.: A posteriori error estimation in finite element analysis. Wiley-Interscience, New York (2000)
- 2(2) Kopteva, N.: Maximum-norm a posteriori error estimates for singularly perturbed reaction-diffusion problems on anisotropic meshes. SIAM J. Numer. Anal. 53 , 2519–2544 (2015)
- 3(3) Kopteva, N.: Energy-norm a posteriori error estimates for singularly perturbed reaction-diffusion problems on anisotropic meshes. Numer. Math. 137 , 607–642 (2017)
- 4(4) Kopteva, N.: Fully computable a posteriori error estimator using anisotropic flux equilibration on anisotropic meshes. ar Xiv:1704.04404 (2017)
- 5(5) Kunert, G.: An a posteriori residual error estimator for the finite element method on anisotropic tetrahedral meshes. Numer. Math. 86 , 471–490 (2000)
- 6(6) Kunert, G.: Robust a posteriori error estimation for a singularly perturbed reaction-diffusion equation on anisotropic tetrahedral meshes. Adv. Comput. Math. 15 , 237–259 (2001)
- 7(7) Kunert, G., Verfürth, R.: Edge residuals dominate a posteriori error estimates for linear finite element methods on anisotropic triangular and tetrahedral meshes. Numer. Math. 86 , 283–303 (2000)
- 8(8) Micheletti, S., Perotto, S.: Reliability and efficiency of an anisotropic Zienkiewicz-Zhu error estimator. Comput. Methods Appl. Mech. Engrg. 195 , 799–835 (2006)
