Lectures on error analysis of interpolation on simplicial triangulations without the shape-regularity assumption Part 1: Lagrange interpolation on triangles
Kenta Kobayashi, Takuya Tsuchiya

TL;DR
This paper reviews error analysis of finite element interpolation on triangles without assuming shape regularity, emphasizing the role of circumradius, aimed at researchers and students.
Contribution
It provides a clear explanation of error estimates for finite element methods on non-shape regular triangulations, focusing on circumradius importance.
Findings
Error estimates can be established without shape regularity assumptions.
Circumradius is a key factor in error analysis.
The paper aims to serve as educational material for researchers and students.
Abstract
In the error analysis of finite element methods, the shape regularity assumption on triangulations is typically imposed to obtain a priori error estimations. In practical computations, however, very thin or degenerated elements that violate the shape regularity assumption may appear when we use adaptive mesh refinement. In this manuscript, we attempt to establish an error analysis approach without the shape regularity assumption on triangulations. We have presented several papers on the error analysis of finite element methods on non-shape regular triangulations. The main points in these papers are that, in the error estimates of finite element methods, the circumradius of the triangles is one of the most important factors. The purpose of this manuscript is to provide a simple and plain explanation of the results to researchers and, in particular, graduate students who are interested in…
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.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · Advanced Numerical Methods in Computational Mathematics · Numerical methods in engineering
Lectures on the Error Analysis of Interpolation
on Simplicial Triangulations without
the Shape Regularity Assumption
Part 1: Lagrange Interpolation on Triangles
Kenta Kobayashi 111Graduate School of Business Administration, Hitotsubashi University, Kunitachi, JAPAN Takuya Tsuchiya 222Graduate School of Science and Engineering, Ehime University, Matsuyama, JAPAN,
(January 18, 2022)
Abstract: In the error analysis of finite element methods, the shape regularity assumption on triangulations is typically imposed to obtain a priori error estimations. In practical computations, however, very “thin” or “degenerated” elements that violate the shape regularity assumption may appear when we use adaptive mesh refinement. In this survey, we attempt to establish an error analysis approach without the shape regularity assumption on triangulations.
We have presented several papers on the error analysis of finite element methods on non-shape regular triangulations. The main points in these papers are that, in the error estimates of finite element methods, the circumradius of the triangles is one of the most important factors.
The purpose of this survey is to provide a simple and plain explanation of the results to researchers and, in particular, graduate students who are interested in the subject. Therefore, this survey is not intended to be a research paper. We hope that, in the near future, it will be merged into a textbook on the mathematical theory of the finite element methods.
1 Introduction: Lagrange interpolation on triangles
Lagrange interpolation on triangles and the associated error estimates are important subjects in numerical analysis. In particular, they are crucial in the error analysis of finite element methods. Throughout this survey, denotes a triangle with vertices , . In this survey, we always assume that triangles are closed sets. Let be the barycentric coordinates of with respect to . By definition, , . Let be the set of nonnegative integers, and be a multi-index. Let be a positive integer. If , then can be regarded as a barycentric coordinate in . The set of points on is defined as 333The set is sometimes called a stencil.
[TABLE]
Let be a set of polynomials defined on whose degree is at most . For a continuous function , the th-order Lagrange interpolation is defined as
[TABLE]
To enable the error analysis of Lagrange interpolation, we typically introduce the following condition [8, 6, 10]. Let and be the diameter of its inscribed circle. Suppose that is a set of (possibly infinitely many) triangles.
Assumption 1** (Shape regularity)**
The set is called shape regular if there exists a constant such that
The maximum of the ratio in is called its chunkiness parameter [6]. The shape regularity condition is sometimes also called the inscribed ball condition. For more information on the conditions equivalent to shape regularity, see [9].
Let be a reference element. The triangle with vertices , , and is typically taken as the reference triangle . Let be an affine transformation that maps to , where is a regular matrix and .
Error analysis is first performed on the reference element . Then, the “pull back” with is used to transfer the result obtained on to the “physical element” .
Let denote the matrix norm of associated with the Euclidean norm of , and let . The function is pulled back by as . Let and be integers such that and . The following theorem is standard.
Theorem 2** ([8], Theorem 3.1.4)**
Let be a constant. If , then there exists a constant independent of such that, for ,
(2)
To derive the second inequality in (2), we use the following lemma.
Lemma 3** ([8], Theorem 3.1.3)**
We have , .
Let be an arbitrary triangle, and be the lengths of its three edges. Note that . Using translation, rotation, and mirror imaging, is transformed into a triangle with vertices , , and , where , , and is the inner angle of at . This triangle is called the standard position of . By the law of cosines,
[TABLE]
Hence, .
These assumptions imply that the affine transformation can be written as with the matrix
[TABLE]
We set , for example (i.e., is a right triangle). Then, , , , and the inequalities in (24) can be rearranged as
[TABLE]
Thus, we might consider that the ratio should not be too large, or should not be too “flat.” This consideration is expressed as the minimum angle condition (Zlámal [28], Ženíšek [27]), which is equivalent to the shape regularity condition for triangles.
Theorem 4** (Minimum angle condition)**
Let , be a constant. If any angle of satisfies and , then there exists a constant independent of such that
However, the minimum angle condition and shape regularity are not necessarily needed to obtain an error estimate. The following condition is well known (Babuška–Aziz [4]).
Theorem 5** (Maximum angle condition)**
Let , be a constant. If any angle of satisfies and , then there exists a constant that is independent of such that
(5)
Křížek [19] introduced the semiregularity condition, which is equivalent to the maximum angle condition (see Remark below). Let be the circumradius of .
Theorem 6** (Semiregularity condition)**
Let and be a constant. If and , then there exists a constant that is independent of such that
We mention a few more known results. Jamet [13] presented the following results.
Theorem 7
Let . Let , be integers such that or . Then, the following estimate holds:
(6)
where is the maximum angle of , and depends only on and .
Remark: (1) In Theorem 7, the restriction on comes from the Sobolev imbedding theorem. Note that in [13, Théorème 3.1] the case is not mentioned explicitly but clearly holds for triangles (see Section 2.5). For the case of the maximum angle condition, we set and find that Jamet’s result (Theorem 7) does not imply the estimation (5) because the case is excluded.
(2) Let an arbitrary triangle be in its standard position (Figure 2). Then is the maximum internal angle of , and
[TABLE]
by the law of sines. Thus, the dimensionless quantity represents the maximum internal angle of , and the boundedness of , which is the semiregularity of , is equivalent to the maximum angle condition with a fixed constant .
For further results of the error estimations on “skinny elements”, see the monograph by Apel [2].
Recently, Kobayashi, one of the authors, obtained the following epoch-making result [14]. Let , , and be the lengths of the three edges of and be the area of .
Theorem 8** (Kobayashi’s formula)**
We define the constant as
Then the following holds:
Recall that is the circumradius of and is written as 444This formula is proved using the law of sines.
[TABLE]
Then, we immediately realize that and obtain a corollary of Kobayashi’s formula.
Corollary 9
For any triangle , the following estimate holds:
(9)
This corollary demonstrates that even if the minimum angle is very small or the maximum angle is very close to , the error converges to [math] if converges to [math]. We consider the isosceles triangle shown in Figure 3 (left). Using (8), we realize that (, ). Thus, if , as .
As another example, let , satisfy . We consider the triangle whose vertices are , , and (Figure 3 (right)). With (8), it is straightforward to see
[TABLE]
Hence, if , the convergence rates that (2) and (9) yield are and , respectively. Therefore, (9) obtains a better convergence rate than (2). Moreover, if , (2) does not yield convergence whereas (9) does. Note that, when , the maximum angles of approach to in both cases.
Although Kobayashi’s formula is remarkable, its proof is long and needs validated numerical computation. We began this research to provide a “paper-and-pencil” proof of (9), and recently reported an error estimation in terms of the circumradius of a triangle [15, 17, 18].
Theorem 10** (Circumradius estimates)**
Let be an arbitrary triangle. Then, for the th-order Lagrange interpolation on , the estimation
(13)
holds for any , where the constant is independent of the geometry of .
We recall that a general triangle may be written using the settings in Figure 2. The essence of the proof of Theorem 10 is that the matrix in (3) is decomposed as
[TABLE]
With this decomposition, the estimate (2) is rearranged as
[TABLE]
As indicated by us [18] and Babuška–Aziz [4], the linear transformation by does not reduce the approximation property of Lagrange interpolation, and only could make it “bad.” This means that the term
[TABLE]
Furthermore, and (the maximum singular values of and ) are bounded using the circumradius and as
[TABLE]
where is the maximum internal angle of (see Figure 2 and (7)). We emphasize that the constants only depend on , , and . Note that, by setting and in (2) (and (4)), we realize that, regardless of how much we try to analyze , we cannot prove Theorem 10. In the sequel of this survey, we will explain the proof of Theorem 10 in detail.
2 Preliminaries
2.1 Notation
Let be a positive integer and be -dimensional Euclidean space. We denote the Euclidean norm of by . Let be the dual space of . We always regard as a column vector and as a row vector. For a matrix and , and denote their transpositions. For matrices and , their Kronecker product is an matrix defined as
[TABLE]
For matrices , , the Kronecker product is defined recursively.
For a differentiable function with variables, its gradient is the row vector defined as
[TABLE]
Let be the set of nonnegative integers. For , the multi-index of partial differentiation (in the sense of distribution) is defined by
[TABLE]
For two multi-indices , , means that . Additionally, and are defined as and , respectively.
Let be a (bounded) domain. The usual Lebesgue space is denoted by for . For a positive integer , the Sobolev space is defined by . For , the norm and semi-norm of are defined as
[TABLE]
and , .
2.2 Preliminaries from matrix analysis
We introduce some facts from the theory of matrix analysis. For their proofs, refer to textbooks on matrix analysis such as [12] and [26].
Let be an integer and be an regular matrix. Note that is symmetric positive-definite and has positive eigenvalues . The square roots of are called the singular values of . Let and be the minimum and maximum eigenvalues. Then,
[TABLE]
For , the matrix norm with respect to the Euclidean norm is defined by
[TABLE]
From these definitions, we realize that and .
For the Kronecker product of matrices, we have the following lemma whose proof is straightforward (see the textbooks mentioned above).
Lemma 11
Let , , , and be matrices. Then, the following equations hold:
Furthermore, if and have eigenvalues and , , respectively, then are eigenvalues of .
Exercise: Prove Lemma 11.
From Lemma 11, we realize that the minimum and maximum eigenvalues of are . Hence, for any ,
[TABLE]
The above facts can be extended straightforwardly to the case of the higher-order Kronecker product . For , (the th Kronecker products), and we have, for ,
[TABLE]
These inequalities imply that
[TABLE]
2.3 Useful inequalities
For positive real numbers , the following inequalities hold:
[TABLE]
Exercise: Prove the inequalities (15) and (16).
2.4 The affine transformation defined by a regular matrix
Let be an matrix with det. We consider the affine transformation defined by for , with . Suppose that a reference region is transformed to a domain by ; . Then, a function defined on is pulled-back to the function on as . Then, we have , , and .
The Kronecker product of the gradient is defined by
[TABLE]
We regard to be a row vector. From this definition, it follows that
[TABLE]
and , . Thus, we have and
[TABLE]
The above inequalities can be easily extended to higher-order derivatives, and we obtain the following inequalities: for ,
[TABLE]
Using the inequalities (15) and (16), we can extend (17) for the case of arbitrary , :
[TABLE]
and
[TABLE]
where we use the fact that contains terms. Therefore, we obtain the following lemma:
Lemma 12
In the above setting of the linear transformation, we have
(18)
where
Proof: We only need to prove the case of , and it is done just by letting in (18).
Let us apply (18) to the case , where is the set of orthogonal matrices. That is, . In this case, . Thus, we have
[TABLE]
Those inequalities mean that, if , the Sobolev norms are not affected by rotations. If , however, they are affected by rotations up to the constants and .
2.5 The Sobolev imbedding theorem
If , Sobolev’s imbedding theorem and Morrey’s inequality imply that
[TABLE]
For proofs of the Sobolev imbedding theorems, see [1] and [7]. For the case , we still have the continuous imbedding . For proof of the critical imbedding, see [1, Theorem 4.12] and [6, Lemma 4.3.4].
2.6 Gagliardo–Nirenberg’s inequality
Theorem 13** (Gagliardo–Nirenberg’s inequality)**
Let . Let , be integers such that Then, for , , the following inequality holds:
where the constant depends only on , , , and .
For the proof and the general cases of Galliardo–Nirenberg’s inequality, see [7] and the references therein.
2.7 A standard error analysis of Lagrange interpolation
In this subsection, we explain a standard error analysis of Lagrange interpolation. First, we prepare a theorem from Ciarlet[8]. Let be a bounded domain with the Lipschitz boundary . Let be a positive integer and be a real with . We consider the quotient space . As usual, we introduce the following norm to the space:
[TABLE]
We also define the seminorm of the space by . Take an arbitrary . If , we have
[TABLE]
and if , we have
[TABLE]
Thus the following inequality follows:
[TABLE]
The next theorem claims the seminorm is actually a norm of .
Theorem 14** (Ciarlet[8], Theorem 3.1.1)**
There exists a positive constant depending only on , , and , such that the following estimations hold
(22)
Proof: Let be the dimension of as a vector space, and be its basis and be the dual basis of . That is, and they satisfy , ( are Kronecker’s deltas). By Hahn-Banach’s theorem, is extended to . For , we have
[TABLE]
Now, we claim that there exists a constant such that
[TABLE]
Suppose that (23) holds. For given , let be defined with the extended by
[TABLE]
Then, we have , . Therefore, The inequality (22) follows from (23).
We now show the inequality (23) by contradiction. Assume that (23) does not hold. Then, there exists a sequence such that
[TABLE]
By the compactness of the inclusion , there exists a subsequence and such that
[TABLE]
Here, is a Cauchy sequence in . We show that it is also a Cauchy sequence in as well. If, for example, , we have
[TABLE]
The case for is similarly shown. Hence, belong s to , and satisfies
[TABLE]
This satisfies
[TABLE]
and thus . Therefore, because
[TABLE]
we conclude . However, this contradicts to .
We are now ready to prove the first inequality in Theorem 2. Recall that is the reference triangle and is mapped as with .
Theorem 15
*Suppose that . Then, there exists a constant
independent of such that*
(24)
Proof: Note that, for arbitrary and , we have
[TABLE]
where is the identity mapping, which is obviously continuous. Therefore, it follows from (22) that
[TABLE]
where the constant depends on , , , , (and ).
Note that the mapping between and ( or ) defined by the pull-back is an isomorphism. By (18), we have
[TABLE]
because of the assumption . Combining these inequalities, the proof is completed with .
Combining these propositions with Lemma 3, we see that, for arbitrary ,
[TABLE]
If there exists a constant such that , then , and we obtain the following standard error estimation.
Theorem 16
Let be a triangle with . Suppose that , where is a positive constant. Then, there exists a constant independent of such that
(25)
3 Babuška–Aziz’s technique
In the previous section, we have proved the standard error estimation (24), (25). To improve them, we introduce the technique given by Babuška–Aziz [4].
Let be the reference triangle with the vertices , , and . For , the sets , , are defined by
[TABLE]
The constant is then defined by
[TABLE]
The second equation in the above definition follows from the symmetry of . The constant (and its reciprocal ) is called the Babuška–Aziz constant for . According to Liu–Kikuchi [22], is the maximum positive solution of the equation , and .
In the following, we show that (Babuška–Aziz [4, Lemma 2.1] and Kobayashi–Tsuchiya [15, Lemma 1]).
Lemma 17
We have , .
Proof: The proof is by contradiction. Assume that . Then, there exists a sequence such that
[TABLE]
From the inequality (22), for an arbitrary , there exists a sequence such that
[TABLE]
Since the sequence is bounded, is also bounded. Therefore, there exists a subsequence such that converges to . Thus, in particular, we have
[TABLE]
Let be the edge of connecting and and be the trace operator. The continuity of and the inclusion yield
[TABLE]
because . Thus, we find that and . This contradicts .
We define the bijective linear transformation by
[TABLE]
The map is called the squeezing transformation.
Now, we consider the “squeezed” triangle . Take an arbitrary , and pull-back to . For, , , we have
[TABLE]
In the following we explain how these equations are derived.
Note that, for and , we have
[TABLE]
and
[TABLE]
Here, , , and used the fact , where is the Jacobian matrix of . Similarly, we obtain
[TABLE]
Therefore, these equations yield (26):
[TABLE]
Similarly, the equations
[TABLE]
are obtained and yield (27) and (28) as
[TABLE]
Next, let . Then, we have
[TABLE]
and obtain
[TABLE]
For a triangle and , we define by
[TABLE]
Note that if , then .
The following lemma is from Babuška–Aziz [4, Lemma 2.2] and Kobayashi–Tsuchiya [15, Lemma 3].
Lemma 18
The constant is defined by
Then, we have .
Proof: Suppose first that . Take an arbitrary and define by , . By (28), we find
[TABLE]
Here, we used the fact that, for , ,
[TABLE]
Note that by the definition of and . Thus, by Lemma 17, we realize that
[TABLE]
By the same reason, we realize that and
[TABLE]
Inserting those inequalities into the above estimation, we obtain
[TABLE]
and conclude
[TABLE]
Next, let . By (31), we immediately obtain
[TABLE]
The following lemma is from Babuška–Aziz [4, Lemma 2.3,2.4] and Kobayashi–Tsuchiya [15, Lemma 4,5].
Lemma 19
The constants , are defined by
Then, we have the estimation .
**Proof: ** The proof of is very similar to that of Lemma 17 and is by contradiction. Supposet that . Then, there exists such that
[TABLE]
Then, by (22), there exists such that
[TABLE]
Since and are bounded, and are bounded as well by Gagliardo–Nirenberg’s inequality (Theorem 13). Hence, is also bounded. Thus, there exists a subsequence which converges to . In particular, we have
[TABLE]
Since , we conclude that and . Therefore, we reach which contradicts to .
We now consider the estimation for the case . From (27) we have
[TABLE]
and Lemma is shown for this case. The proof for the case is very similar.
Exercise: In Lemma 19, prove the case .
We may apply Lemmas 18 and 19 to for , and obtain the following corollary.
Corollary 20
For arbitrary , the following estimations hold:
4 Extending Babuška-Aziz’s technique to the higher order
Lagrange interpolation
In this section, we prove the following theorem using Babuška-Aziz’s technique. Let be a positive integer and be such that . The set is defined by
[TABLE]
where is defined by (1). Note that if , then .
Theorem 21
Take arbitrary and . Then, there exists a constant such that, for ,
(32)
Here, depends only on , , and , and is independent of and .
Applying Theorem 21 to for , and obtain the following corollary.
Corollary 22
For arbitrary , the following estimations hold:
The manner of the proof of Theorem 21 is exactly similar as in the previous section. The ratio is written using the seminorms of on , and is bounded by a constant that does not depend on .
First, let . For a multi-index and a real , set . Then, we have
[TABLE]
Here, we used the fact that, for a multi-index , and, for a multi-index with ,
[TABLE]
For example, if , then we see
[TABLE]
and
[TABLE]
In the above, we use the notation instead of for simplicity.
Exercise: Confirm the details of the above inequalities, in particular, (33).
Now suppose that, for and a multi-index , the set is defined so that
[TABLE]
and
[TABLE]
hold. Then, from (33), we would conclude that
[TABLE]
Our task now is to define that satisfies (34) and (35). We will explain the details in the following sections.
5 Difference quotients
In this section, we define the difference quotients for two-variable functions. Our treatment is based on the theory of difference quotients of one-variable functions given in standard textbooks such as [3] and [25]. All statements in this section can be readily proved.
5.1 Difference quotients of one-variable functions
For a function and nodal points , the difference quotients of are defined recursively by
[TABLE]
A simplest case is , , with . In this case, the difference quotients are
[TABLE]
and so on. The difference quotients are expressed by integration:
[TABLE]
For , the following formula holds:
[TABLE]
Exercise: Prove (37) by induction.
5.2 Difference quotients of two variable functions
We now extend the difference quotient to functions with two variables. For a positive integer , the set is defined by
[TABLE]
where is understood as the coordinate of a point in .
For and a multi-index with , we define the correspondence between nodes by
[TABLE]
For example, and . Using , we define the difference quotients on for by
[TABLE]
For simplicity, we denote by . The following are examples of :
[TABLE]
Let be such that and . The difference quotients clearly satisfy the following recursive relations:
[TABLE]
If , the difference quotient is written as an integral of . Setting and , for example, we have
[TABLE]
To provide a concise expression for the above integral, we introduce the -simplex
[TABLE]
and the integral of on is defined by
[TABLE]
where . Then, becomes
[TABLE]
For a general multi-index , we have
[TABLE]
Let be the rectangle defined by and as the diagonal points. If or , degenerates to a segment. For and with , we denote the integral as
[TABLE]
If degenerates to a segment, the integral is understood as an integral on the segment. By this notation, the difference quotient is written as
[TABLE]
Therefore, if , then we have
[TABLE]
**Exercise: ** Confirm that all the equations in this section certainly hold.
6 The proof of Theorem 21
By introducing the notation in the previous section, we now be able to define and for , which satisfy (34) and (35). For multi-index , define
[TABLE]
From the definition and (38), it is clear that (34) holds. Define
[TABLE]
Then, the following lemma holds.
Lemma 23
We have . That is, if belongs to , then .
Proof: We notice that . For example, if and , then . This corresponds to the fact that, in , there are six squares with size for and there are six horizontal segments of length for . All their vertices (corners and end-points) belong to (see Figure 5). Now, suppose that satisfies for all . This condition is linearly independent and determines uniquely.
To understand the above proof clearly, we consider the cases and . Let and . Then, . Set . If the three integrals
[TABLE]
are equal to [math], then we have , that is, . The case is similar.
Let and . Then, . Set . If the integrals
[TABLE]
are all equal to [math], we have . Moreover, if the integrals
[TABLE]
are equal to [math] as well, we have . Hence, we conclude that . The case is similar.
Lemma 24
We have , . That is, (35) holds.
Proof: The proof is by contradiction. Suppose that . Then, there exists a sequence such that
[TABLE]
By the inequality (22), for an arbitrary , there exists a sequence such that
[TABLE]
Since and are bounded, () is bounded as well by Gagliardo–Nirenberg’s inequality (Theorem 13). That is, and are bounded. Thus, there exists a subsequence such that converges to . In particular, we see
[TABLE]
Therefore, for any , we notice that
[TABLE]
and by Lemma 23. This yields
[TABLE]
which contradicts .
Now, we have defined the set that satisfies (34) and the estimate (35) has been shown. Therefore, Theorem 21 has been proved by (36).
**Exercise: ** We have shown the Theorem 21 for the case . Prove Theorem 21 for the case .
7 The error estimation on general triangles in terms of circumradius
Using the previous results, we can obtain the error estimations on general triangles. Recall the reference triangle and the definition of the standard position of an aribtrary triangle (Figure 2). Let be the triangle with the vertices , , and . Let be the reference triangle with the vertices , , and .
We consider matrices
[TABLE]
and the linear transformation . The reference triangle is transformed to by , and is transformed to by . Accordingly, is pulled-back to by the mapping , and is pulled-back to by the mapping .
By Theorem 21, for arbitrary and arbitrary , , there exists a constant depending only on , , such that
[TABLE]
A simple computation confirms that has the eigenvalues , and has the eigenvalues . That is, , , and . Therefore, defining for , it follows from (18) that
[TABLE]
Combining the above inequalities and (39), we obtain
[TABLE]
where . Hence, we obtain the following lemma.
Lemma 25
For an arbitrary triangle in the standard position, we have
where and .
Applying Lemma 25 to , we have the following corollary.
Corollary 26
For an arbitrary triangle in the standard position, we have
We would like to obtain upper bounds of and . From Lemma 25, we obviously have . For , we observe that
[TABLE]
Thus, redefining the constant , we obtain the following theorem.
Theorem 27
Suppose that a triangle is in the standard position. Let , be integers with , and . Then, the following estimate holds:
where is the circumradius of , and is a constant depending only on , , and .
Now, let be an arbitrary triangle. Note that and the Sobolev norms are affected by rotations if up to an constant (see (19)). Then, with rewriting the constant, we obtain the following corollary from Theorem 27, that is the main theorem of this survey (reprint of Theorem 13).
Corollary 28
Let be an arbitrary triangle with circumradius . Let and be intergers with and . Let , . For the Lagrange interpolation of degree on , the following estimate holds: for any ,
where depends only on , , and .
Remarks: (1) Let be a bounded polygonal domain. We compute a numerical solution of the Poisson equation
[TABLE]
by the conforming piecewise th-order finite element method on simplicial elements. To this end, we construct a triangulation of and consider the piecewise continuous function space . The weak form of the Poisson equation is
[TABLE]
and the finite element solution is defined as the unique solution of
[TABLE]
Céa’s Lemma implies that the error is estimated as
[TABLE]
Combining (41) and Corollary 28 with , , , we have
[TABLE]
Therefore, if as and , the finite element solution converges to the exact solution even if there exist many skinny elements violating the shape regularity condition or the maximum angle condition in .
Recall the triangle depicted in Figure 3 (right) with vertices , , and with . Suppose now that . If a sequence of triangulations contains those triangles, and , then and the piecewise linear Lagrange FEM might not converge. However, if , then , and the finite element solution certainly converges to the exact solution, although the convergence rate is worse than expected. This means that “bad” triangulations with many very skinny triangles can be remedied by using higher-order Lagrange elements.
8 Numerical experiments
To confirm the results obtained, we perform numerical experiments similar to those in [11]. Let , , and with . Then we consider the following Poisson equation: Find such that
[TABLE]
The exact solution of (42) is and its graph is a part of the cylinder. For a given positive integer and , we consider the isosceles triangle with base length and height , as shown in Figure 7. Let be the circumradius of the triangle. For comparison, we also consider the isosceles triangle with base length and height for . We triangulate with this triangle, as shown in Figure 7. Let be the triangulation. As usual, the set of piecewise linear functions on and its subsets are defined by
[TABLE]
Then, the piecewise linear finite element method for (42) is defined as follows: Find such that
[TABLE]
where is the inner product of . By Céa’s lemma and the result obtained, we obtain the estimation
[TABLE]
The behavior of the error is given in Figure 7. The horizontal axis represents the mesh size measured by the maximum diameter of triangles in the meshes and the vertical axis represents the error associated with FEM solutions in the semi-norm. The graph clearly shows that the convergence rates worsen as approaches . For , the FEM solutions even diverge. This is a counterexample to the vaguely believed dogma that “FEM solutions always converge to the exact solution if ”. See also [23].
We replot the same data in Figure 8, in which the horizontal axis represents the maximum of the circumradius of triangles in the meshes. Figure 8 shows convergence rates are almost the same in all cases if we measure these with the circumradius. These experiments strongly support that our theoretical results are correct and optimal.
Acknowledgments
We thank Dr. Théophile Chaumont-Frelet for his valuable comments.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R.A. Adams, J.J.F. Fournier : Sobolev Spaces, 2nd edition, Pure and Applied Mathematics 140, Elsevier/Academic Press, New York, 2003.
- 2[2] T. Apel : Anisotropic Finite Element: Local estimates and applications, Advances in Numerical Mathematics. B.G. Teubner, Stuttgart, 1999.
- 3[3] K.E. Atkinson : An Introduction to Numerical Analysis, 2nd edition, John Wiley & Sons, New York, 1989.
- 4[4] I. Babuška, A.K. Aziz : On the angle condition in the finite element method, SIAM J. Numer. Anal. 13 (1976), 214–226.
- 5[5] R.E. Barnhill, J.A. Gregory : Sard kernel theorems on triangular domains with application to finite element error bounds. Numer. Math., 25 (1976), 215-229.
- 6[6] S.C. Brenner, L.R. Scott : The Mathematical Theory of Finite Element Methods. 3rd edition. Texts in Applied Mathematics 15, Springer, New York, 2008.
- 7[7] H. Brezis : Functional Analysis, Sobolev Spaces and Partial Differential Equations. Universitext, Springer, New York, 2011.
- 8[8] P.G. Ciarlet : The Finite Element Methods for Elliptic Problems. Classics in Applied Mathematics 40, SIAM, Philadelphia, 2002, Reprint of the 1978 original (North Holland, Amsterdam).
