Abstract
In this paper the Synge maximum angle condition for planar triangulations is generalized for higher-dimensional simplicial partitions. In addition, optimal interpolation properties are presented for linear simplicial elements which can degenerate in certain ways.
Access provided by Autonomous University of Puebla. Download conference paper PDF
Similar content being viewed by others
1 Introduction
Consider a family \(\mathcal {F} = \{\mathcal {T}_h\}_{h \to 0}\) of face-to-face triangulations \(\mathcal {T}_h\) of a bounded polygonal domain. In 1957, J. Synge proved that linear triangular finite elements yield the optimal interpolation order in the C-norm provided the maximum angle condition is satisfied, i.e., there exists a constant γ 0 < π such that for any triangulation \(\mathcal {T}_h \in \mathcal {F}\) and any triangle \(T \in \mathcal {T}_h\) one has (see [27])
where γ T is the maximum angle of T. In 1975/1976, Babuška and Aziz [3], Barnhill and Gregory [4], and Jamet [14] independently derived the optimal interpolation order in the energy norm of finite element approximations under the condition (1). Later the maximum angle condition was investigated in various norms in [1, 2, 15,16,17,18, 22, 24, 25].
In 1992, the condition (1) was generalized by Křížek [19] to tetrahedral elements as follows:
There exists a constant γ 0 < π such that for any face-to-face tetrahedralization \(\mathcal {T}_h \in \mathcal {F}\) and any tetrahedron \(T \in \mathcal {T}_h\) one has
where γ D is the maximum dihedral angles between faces of T and γ F is the maximum angle in all four triangular faces of T. According to [20], the associated finite element approximations preserve the optimal interpolation order in the H 1-norm under the condition (1).
Note that degenerated tetrahedral elements have a lot of real-life technical applications. For example, in calculation of physical fields in eletrical rotary machines, see [20]. Flat tetrahedral elements are also used to approximate thin slots, layers, or gaps. Moreover, they are suitable when the true solution of some problem changes more rapidly in one direction than in another direction (e.g. in anisotropic materials) [1].
From Fig. 1 we observe that the condition (2) is satisfied for a needle, splinter, and wedge tetrahedron. For the other degenerated tetrahedra from Fig. 1, the interpolation error may diverge in the H 1-norm. On the other hand, the finite element method may converge in the H 1-norm, see [12]. Hence, (2) represents only a sufficient (and not necessary) condition for the convergence of the finite element method, see [21,22,23, 25].
Let us point out that the two conditions in (2) are independent. For instance, for a sliver (and also cap) tetrahedron the condition γ D ≤ γ 0 does not hold while γ F ≤ γ 0 holds. On the other hand, for a spike tetrahedron γ D ≤ γ 0 holds and γ F ≤ γ 0 is violated.
Since there are six dihedral angles of each tetrahedron and twelve angles between its adjacent edges, a direct generalization of (2) into higher dimensions would be technically quite complicated. Therefore, in the next section we introduce another concept which is based on the d-dimensional sine for d > 1. We will survey the main results from our previous paper [13], see also [5, 6].
2 The Maximum Angle Condition in Higher Dimensions
Recall that a d-simplex S in R d, d ∈{1, 2, 3, … }, is the convex hull of d + 1 vertices A 0, A 1, …, A d that do not belong to the same (d − 1)-dimensional hyperplane, i.e.,
Let
be the facet of S opposite to the vertex A i for i ∈{0, …, d}.
In 1978, Eriksson has introduced a generalization of the sine function to an arbitrary d-dimensional spatial angle, see [10, p. 74].
Definition 1
Let \(\hat A_i\) be the angle at the vertex A i of the simplex S. Then d-sine of the angle \(\hat A_i\) for d > 1 is given by
Remark 2
Let us show that d-sine is really a generalization of the classical sine function. Set d = 2 and consider an arbitrary triangle A 0 A 1 A 2. Denote by \(\hat A_{0}\) its angle at the vertex A 0. Then, obviously,
Comparing this relation with (3), we find that
Definition 3
A family \(\mathcal {F} = \{\mathcal {T}_h \}_{h \to 0}\) of partitions of a polytope into d-simplices is said to satisfy the generalized minimum angle condition if there exists C > 0 such that for any \(\mathcal {T}_h \in \mathcal {F}\) and any \(S = \mathrm {conv} \{ A_0, \dots , A_{d} \} \in \mathcal {T}_h\) one has
This condition is investigated in the paper [6]. It generalizes the well-known Zlámal minimum angle condition for triangles (see [8, 28, 29]), which is stronger than (1).
Definition 4
A family \(\mathcal {F} = \{\mathcal {T}_h \}_{h \to 0}\) of partitions of a polytope into d-simplices is said to satisfy the generalized maximum angle condition if there exists C > 0 such that for any \(\mathcal {T}_h \in \mathcal {F}\) and any \(S = \mathrm {conv} \{ A_0, \dots , A_{d} \} \in \mathcal {T}_h\) one can always choose d edges of S, which, when considered as vectors, constitute a (higher-dimensional) angle whose d-sine is bounded from below by the constant C.
Remark 5
From (4) and (5) we observe that the condition stated in Definition 4 for d = 2 is equivalent to the maximum angle condition (1).
Remark 6
Let us show that in case of tetrahedra the validity of the maximum angle condition (2) implies the desired property in Definition 4, i.e. it is really a generalization. So, let (2) be valid for a given tetrahedron T. Then one can always find, see the proof of Theorem 7 in [19, pp. 517–518], three unit vectors t 1, t 2, and t 3 parallel to three edges of T, so that the volume of the parallelepiped \(\mathcal {P}(t_1, t_2, t_3)\) generated by t 1, t 2, t 3 is bounded from below by some constant c > 0. Now we use formula (3) to estimate the 3-dimensional sine of the angle formed by the vectors t 1, t 2, t 3 as follows
where S(t 1, t 2, t 3) is the tetrahedron made by t 1, t 2, t 3 originating at 0, and the area of each of the three faces F j involved is bounded from above by 1∕2 due to the fact that t 1, t 2, t 3 are unit vectors. The constant c can be, in fact, estimated from below by
see [19, p. 518].
Now we present the main interpolation theorem of this paper using the standard Sobolev space notation.
Theorem 7
Let \(\mathcal {F}\) be a family of partitions of a polytope into d-simplices satisfying the generalized maximum angle condition. Then there exists a constant C > 0 such that for any \(\mathcal {T}_h \in \mathcal {F}\) and any \(S \in \mathcal {T}_h\) we have
where π S is the standard Lagrange linear interpolant and h S = diam S.
For the proof see [13].
3 Examples
Example 1
Denoting by A 0, A 1, A 2, A 3 the vertices of spindle, spear, spike, spade, cap, or sliver tetrahedron from Fig. 1 in an arbitrary way, we find by (3) that
as the discretization parameter tends to zero. The same is true for the splinter tetrahedron. However, by Definition 4 we may choose three edges which constitute a spatial angle whose 3-sine is bounded from below by a fixed constant C > 0. Choosing the two short edges of the splinter tetrahedron and one long edge, we find that the generalized maximum angle condition holds.
Example 2
We show that if sin3 of two trihedral angles (cf. [11]) are the same numbers, then the magnitude of these solid angles in steradians need not be the same. Let A 0 A 1 A 2 A 3 be the regular tetrahedron whose edges have length 1. Then the altitude of its faces is \(\sqrt {3}/2\) and the spatial altitude is \(\sqrt {6}/3\). Consequently, from (3) for the trihedral angle \(\hat A_0\) we get
Consider now the tetrahedron with vertices B 0 = (0, 0, 0), B 1 = (1, 0, 0), , and B 3 = (0, 0, 1). Then by (3) we also find that
Now by the Girard Theorem for the spherical excess we have (see [26, p. 83])
whereas
where all dihedral angles α of A 0 A 1 A 2 A 3 are ≈ 70.52∘, since .
Example 3
The sliver element from Fig. 1 can be narrowed as follows. For h → 0 consider the tetrahedron with vertices
Example 4
A higher-dimensional example can be constructed in the following way. Consider positive numbers r 1, r 2, …, r d and a simplex with vertices A 0, A 1, …, A d. We fix some number k so that 0 ≤ k ≤ d. The first k + 1 vertices of the simplex are defined as follows. Let A 0 = (0, 0, …, 0, …, 0). Further, let
The remaining vertices are:
Therefore, for k = 0, we get the path-simplex, and for k = d the hypercube-corner simplex. Allowing some of the r k’s to approach zero with different rates, in general, we get various degenerated simplices still satisfying the generalized maximum angle conditions.
References
T. Apel, Anisotropic Finite Elements: Local Estimates and Applications. Advances in Applied Mathematics (B.G. Teubner, Stuttgart, 1999)
T. Apel, M. Dobrowolski, Anisotropic interpolation with applications to the finite element method. Computing 47, 277–293 (1992)
I. Babuška, A.K. Aziz, On the angle condition in the finite element method. SIAM J. Numer. Anal. 13, 214–226 (1976)
R.E. Barnhill, J.A. Gregory, Sard kernel theorems on triangular domains with applications to finite element error bounds. Numer. Math. 25, 215–229 (1976)
J. Brandts, S. Korotov, M. Křížek, On the equivalence of ball conditions for simplicial finite elements in R d. Appl. Math. Lett. 22, 1210–1212 (2009)
J. Brandts, S. Korotov, M. Křížek, Generalization of the Zlámal condition for simplicial finite elements in R d. Appl. Math. 56, 417–424 (2011)
S.W. Cheng, T.K. Dey, H. Edelsbrunner, M.A. Facello, S.H. Teng, Sliver exudation, in Proceedings of 15-th ACM Symposium on Computational Geometry (1999), pp. 1–13
P.G. Ciarlet, The Finite Element Method for Elliptic Problems (North-Holland, Amsterdam, 1978)
H. Edelsbrunner, Triangulations and meshes in computational geometry. Acta Numer. 9, 133–213 (2000)
F. Eriksson, The law of sines for tetrahedra and n-simplices. Geom. Dedicata 7, 71–80 (1978)
J.W. Gaddum, The sums of dihedral and trihedral angles in a tetrahedron. Am. Math. Mon. 59, 370–371 (1952)
A. Hannukainen, S. Korotov, M. Křížek, The maximum angle condition is not necessary for convergence of the finite element method. Numer. Math. 120, 79–88 (2012)
A. Hannukainen, S. Korotov, M. Křížek, Generalizations of the Synge-type condition in the finite element method. Appl. Math. 62, 1–13 (2017)
P. Jamet, Estimation de l’erreur pour des éléments finis droits presque dégénérés. RAIRO Anal. Numér. 10, 43–60 (1976)
K. Kobayashi, T. Tsuchiya, On the circumradius condition for piecewise linear trian-gular elements. Jpn. J. Ind. Appl. Math. 32, 65–76 (2015)
K. Kobayashi, T. Tsuchiya, A priori error estimates for Lagrange intrepolation on triangles. Appl. Math. 60, 485–499 (2015)
K. Kobayashi, T. Tsuchiya, Extending Babuška-Aziz theorem to higher-order Largange interpolation. Appl. Math. 61, 121–133 (2016)
M. Křížek, On semiregular families of triangulations and linear interpolation. Appl. Math. 36, 223–232 (1991)
M. Křížek, On the maximum angle condition for linear tetrahedral elements. SIAM J. Numer. Anal. 29, 513–520 (1992)
M. Křížek, P. Neittaanmäki, Mathematical and Numerical Modelling in Electrical Engineering: Theory and Applications (Kluwer Academic Publishers, Dordrecht, 1996)
V. Kučera, A note on necessary and sufficient condition for convergence of the finite element method, in Proceedings of Conference on Applied Mathematics 2015, ed. by J. Brandts et al. (Institute of Mathematical, Prague, 2015), pp. 132–139
V. Kučera, Several notes on the circumradius condition. Appl. Math. 61, 287–298 (2016)
V. Kučera, On necessary and sufficient conditions for finite element convergence. Numer. Math (submitted). Arxiv 1601.02942
S. Mao, Z. Shi, Error estimates of triangular finite elements under a weak angle condition. J. Comput. Appl. Math. 230, 329–331 (2009)
P. Oswald, Divergence of FEM: Babuška-Aziz triangulations revisited. Appl. Math. 60, 473–484 (2015)
K. Rektorys, Survey of Applicable Mathematics I (Kluwer Academic Publishers, Dordrecht, 1994)
J.L. Synge, The Hypercircle in Mathematical Physics (Cambridge University Press, Cambridge, 1957)
A. Ženíšek, The convergence of the finite element method for boundary value problems of a system of elliptic equations (in Czech). Appl. Math. 14, 355–377 (1969)
M. Zlámal, On the finite element method. Numer. Math. 12, 394–409 (1968)
Acknowledgements
The authors are indebted to Prof. Jan Brandts, Prof. Takuya Tsuchiya, and Prof. Jon Eivind Vatne for valuable suggestions. The third author was supported by RVO 67985840 of the Czech Republic and Grant no. 18-09628S of the Grant Agency of the Czech Republic.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Hannukainen, A., Korotov, S., Křížek, M. (2019). Maximum Angle Condition for n-Dimensional Simplicial Elements. In: Radu, F., Kumar, K., Berre, I., Nordbotten, J., Pop, I. (eds) Numerical Mathematics and Advanced Applications ENUMATH 2017. ENUMATH 2017. Lecture Notes in Computational Science and Engineering, vol 126. Springer, Cham. https://doi.org/10.1007/978-3-319-96415-7_72
Download citation
DOI: https://doi.org/10.1007/978-3-319-96415-7_72
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-96414-0
Online ISBN: 978-3-319-96415-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)