Finite Element Methods for the Laplace-Beltrami Operator
Andrea Bonito, Alan Demlow, Ricardo H. Nochetto

TL;DR
This survey compares three finite element methods—parametric, trace, and narrow band—for solving PDEs on surfaces, providing error estimates and analyzing their relation to surface regularity and representation.
Contribution
It systematically analyzes and compares three finite element approaches for surface PDEs, offering optimal and a posteriori error estimates and insights into their practical implementation.
Findings
All methods achieve optimal a priori error estimates.
Error estimates depend on surface regularity and representation.
The survey clarifies the relationship between surface smoothness and method properties.
Abstract
Partial differential equations posed on surfaces arise in a number of applications. In this survey we describe three popular finite element methods for approximating solutions to the Laplace-Beltrami problem posed on an -dimensional surface embedded in : the parametric, trace, and narrow band methods. The parametric method entails constructing an approximating polyhedral surface whose faces comprise the finite element triangulation. The finite element method is then posed over the approximate surface in a manner very similar to standard FEM on Euclidean domains. In the trace method it is assumed that the given surface is embedded in an -dimensional domain which has itself been triangulated. An -dimensional approximate surface is then constructed roughly speaking by interpolating over the…
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 Methods in Computational Mathematics · Numerical methods in engineering · Electromagnetic Simulation and Numerical Methods
Finite Element Methods for the
Laplace-Beltrami Operator
Andrea Bonito
Department of Mathematics, Texas A&M University, College Station, TX 77843, USA; [email protected]
,
Alan Demlow
Department of Mathematics, Texas A&M University, College Station, TX 77843, USA; [email protected]
and
Ricardo H. Nochetto
University of Maryland, College Park, MD 20742, USA; [email protected]
Abstract.
Partial differential equations posed on surfaces arise in a number of applications. In this survey we describe three popular finite element methods for approximating solutions to the Laplace-Beltrami problem posed on an -dimensional surface embedded in : the parametric, trace, and narrow band methods. The parametric method entails constructing an approximating polyhedral surface whose faces comprise the finite element triangulation. The finite element method is then posed over the approximate surface in a manner very similar to standard FEM on Euclidean domains. In the trace method it is assumed that the given surface is embedded in an -dimensional domain which has itself been triangulated. An -dimensional approximate surface is then constructed roughly speaking by interpolating over the triangulation of , and the finite element space over consists of the trace (restriction) of a standard finite element space on to . In the narrow band method the PDE posed on the surface is extended to a triangulated -dimensional band about whose width is proportional to the diameter of elements in the triangulation. In all cases we provide optimal a priori error estimates for the lowest-order finite element methods, and we also present a posteriori error estimates for the parametric and trace methods. Our presentation focuses especially on the relationship between the regularity of the surface , which is never assumed better than of class , the manner in which is represented in theory and practice, and the properties of the resulting methods.
Key words and phrases:
Surface partial differential equations, Laplace-Beltrami operator, surface finite element methods, parametric finite element methods, trace finite element methods, narrow band finite element methods, a-priori and a-posteriori error estimates.
AB is partially supported by NSF grant DMS-1817691.
AD is partially supported by NSF grant DMS-1720369.
RHN is partially supported by NSF grant DMS–1411808.
1. Introduction
Partial differential equations (PDEs) posed on surfaces play an important role in many domains of pure and applied mathematics, including geometry, modeling of materials, fluid flow, and image and shape processing. The numerical approximation of such surface PDEs is both practically important and the source of many mathematically rich problems.
We consider a closed, compact and orientable surface in of co-dimension . The Laplace-Beltrami operator , which acts as a generalization of the standard Euclidean Laplace operator, plays a central role in both static and time-dependent surface PDE models arising in a wide range of applications. Because of this a wide variety of numerical methods have been developed for the Laplace-Beltrami equation
[TABLE]
where is a given forcing function satisfying . In this article we first lay out some important notions from differential geometry. We then describe three important classes of finite element methods (FEMs) for the Laplace-Beltrami problem: the parametric method, the trace method, and the narrow band method. In all three cases we focus on the simplest case of piecewise linear finite element spaces and give an in-depth discussion of the effects of geometry on error behavior.
The parametric finite element method was introduced in 1988 by Dziuk [Dzi88], with some important related techniques appearing in earlier works on boundary element methods [Néd76, Ben84]. This method is the simplest of the many FEM that have been developed for solving the Laplace-Beltrami problem. The given PDE is first written in weak form as: Find such that and
[TABLE]
Here is the set of functions in whose tangential gradient . The continuous surface is approximated by a polyhedral surface whose faces serve as a finite element mesh, and the finite element space is made of continuous piecewise linear functions over . The finite element method then consists of finding such that
[TABLE]
where is a suitable approximation (lift) of defined on . In its conception and implementation, the resulting method is very similar to canonical FEM for solving Poisson’s problem on Euclidean domains. To quote Dziuk, “…the numerical scheme is just the same as in a plane-two dimensional problem. The only difference is that in our case the computer has to memorize three-dimensional nodes instead of two-dimensional ones.” [Dzi88, p. 143]. The strategy underlying parametric surface finite element methods –direct translation of FEM on Euclidean spaces to triangulated surfaces– has subsequently been applied to a variety of methods. These include higher-order standard Lagrange methods [Dem09], various types of discontinuous Galerkin methods [ADM*+*15, DMS13, CD16], and mixed methods in classical, hybridized, and finite element exterior calculus formulations [Ben84, HS12, CD16, FFF16]. A posteriori error estimation and adaptivity have been studied in [DD07, WCH10, BCMN13, DM16, BCM*+*16, BD19]. Finally, we refer to the survey article [DE13].
In many applications in which surface PDEs are to be solved, a background volume (bulk) mesh is already present. A paradigm example is two-phase fluid flow, in which effects on the interface between the two phases such as surface tension are coupled with standard equations of fluid dynamics on the bulk. In these cases it is advantageous to utilize the background volume mesh to solve surface PDEs instead of independently meshing . This is especially the case when is evolving, since the meshes needed for the parametric method typically distort as changes and periodic remeshing is thus necessary. The trace and narrow band methods both employ background bulk meshes in order to solve surface PDEs.
Trace (or cut) FEMs for the Laplace-Beltrami problem were first introduced in [ORG09]. In this method an approximating surface is constructed as in the parametric method, but using a different approach. An implicit representation of as the level set of some function is used, that is, it is assumed that
[TABLE]
A discrete surface is then defined as the zero level set of an interpolant of on the background mesh, and the finite element space is taken to be the trace of the bulk finite element space on . The FEM is posed and solved on as in the parametric method. Note that the finite element space in the trace method consists of continuous piecewise linear functions over the faces of . However, because the faces of are arbitrary intersections of -dimensional hyperplanes with -simplices, they are not shape regular, and in particular may either fail to satisfy a minimum angle condition or be much smaller than the bulk simplices from which they are derived. Counter to natural intuition about the quality of a finite element method posed on such a mesh, the trace method satisfies optimal error bounds and works well in practice. In addition to the basic analysis of piecewise linear methods that we present below, the literature on trace methods for the Laplace-Beltrami problem includes study of matrix properties [OR10], adaptive versions [DO12, CO15], and extensions to higher-order [Reu15, GR16, GLR18], stabilized [BHL15, BHL*+*16], and discontinuous Galerkin [BHLM17] methods. We refer to the recent survey article [OR17].
Narrow band methods also employ a bulk mesh in order to approximate surface PDEs, but extend a surface PDE to the bulk instead of restricting a bulk finite element space to a surface. This idea appeared first in [BCOS01] and is based on an extension of the PDE into a tubular neighborhood of width about that reads
[TABLE]
Here is an extension of from to and is the distance function . The latter is chosen for simplicity over a generic level set function to represent throughout this article. Because is the unit outward normal to , the coefficient matrix is degenerate in the direction normal to , and the operator is thus elliptic but degenerate. We emphasize that in contrast to most previous literature on narrow band FEM we do not include a zero order term in our presentation, thereby adding extra difficulty due to the need to account for the non-trivial kernel of on closed surfaces. In narrow band FEMs, the Galerkin approximations to are posed over a discrete approximation to the narrow band . Related methods that involve extending surface PDEs to bulk domains include the closest point method [RM08].
Narrow-band unfitted finite element methods have been proposed and analyzed by different authors. In [Bur09], the aforementioned degenerate extension is shown to be well posed and error bounds in the weighted bulk energy norm are derived. Subsequently, error estimates in the norm are obtained in [DDEH10] for the lower order method. An alternate nondegenerate extension is then proposed in [DER14] leading to optimal and also error estimates for the lower order method when is (or is close to) the constant normal extension of . Independently, higher order methods are proposed and analyzed in [OS16] using the extension
[TABLE]
with \mu:=\det\big{(}I-dD^{2}d\big{)} and the constant normal extension of . Note also that the associated FEM requires a sufficiently accurate approximation of (if not known explicitly). For the case of lowest order (piecewise linear) finite element spaces, it is enough to approximate with zero and thereby retrieve the discrete formulation in [DER14].
In the construction of all three FEMs above, we incur on variational crimes (consistency errors) due to the approximation of geometry. In the parametric and trace methods, these errors arise because the finite element method is posed over a discrete approximation to , thereby leading to different bilinear forms ( and ) used to compute the continuous and finite element solutions ( and ). In the narrow band method the finite element equations are posed over a discrete narrow band instead of over the domain on which the extended solution is defined. This again entails the use of different bilinear forms in the definitions of the continuous and discrete solutions. A core problem in surface FEMs is understanding and controlling these errors, which are typically called geometric consistency errors or geometric errors. In order to analyze these errors, it is necessary to define a map and then compare with for given functions . This is done via a change of variables argument for the map . There may be several competing demands of both theoretical and practical nature that come into play when choosing the map , and a main focus of this article is to elucidate how this choice affects analysis and implementation of surface FEMs.
The canonical choice of the map is defined via the so-called signed distance function . The distance function is defined on a tubular neighborhood of and is of the same regularity class as provided that is at least and is sufficiently narrow. In such a case, the map (also called distance-lift or orthogonal closest point projection)
[TABLE]
is well defined and is of class . The maps and play a crucial role in analyzing and in some cases defining the numerical algorithms presented below. In particular, the distance function is a critical tool in proving error estimates that are of optimal order with respect to geometric consistency errors. When a generic map is instead used to analyze surface FEMs, the predicted behavior of geometric errors is of one order less than is seen in practice and also than may be proved using the closest point projection. More precisely, when quasi-uniform meshes of size are used with affine surface approximations in the parametric and trace methods, arguments which use special properties of the closest point projection predict an geometric errors, and these are in fact observed in practice. On the other hand, standard proofs employing a generic map instead of the distance function map predict only order geometric errors. This increase in convergence order due to the properties of the closest point projection may be viewed as a superconvergence effect.
Reliance on may however also constitute a serious drawback for several reasons. First, has a closed form expression only for the sphere and torus, so it is in general not directly available to the user. We thus discuss how to use the distance function only as a theoretical tool for the parametric FEM and yet retain the superconvergence properties of . On a practical level, the user is still free to choose from a much more general class of lifts to implement an algorithm. Our presentation includes optimal a priori and a posteriori estimates in and optimal a priori estimates in for an algorithm whose implementation only requires access to a generic lift ; the latter appear to be new in the literature even for smooth surfaces. Second, if is merely for , then the closest point projection is not uniquely defined in any neighborhood of . We thus also provide an analysis of parametric FEMs for of class that instead makes use of a generic parametric map. The price we pay is a possible order reduction of the method due to the loss of superconvergence properties of . Finally, previous proofs of optimal-order error estimates employing have required that is of class and thus of class ; cf. [Dzi88]. However, the solution to the Laplace-Beltrami problem already possesses the regularity needed to ensure optimal convergence of piecewise linear finite element methods when is of class . In this survey we bridge this gap by giving a novel error analysis for the three FEMs which is based exclusively on regularity of and , but which also preserves the superconvergence property in the geometric error. In the case of the trace and narrow band methods we achieve this by a regularization argument.
This article is organized as follows. In section 2 we introduce surface gradient, divergence and Laplace-Beltrami operators along with the signed distance function and its most relevant properties. In section 3 we quantify the geometric effects of perturbing surfaces of class and . We also present extensions to a tubular neigborhood of width
[TABLE]
of functions provided is of class . This turns out to be essential for our later error analysis of the trace and narrow band methods for surfaces. In section 4 we give a selfcontained exposition of parametric FEMs for surfaces of class and , including a priori and a posteriori error analyses. In section 5 we describe the trace method and conclude in section 6 with the narrow band method. Both discussions assume regularity of .
2. Calculus on Surfaces
In this section we discuss basic concepts of differential geometry. We start in section 2.1 by describing the paramatric representaton of via charts. This classical point of view is critical to introduce the first fundamental form , the area element , and the unit normal of . We present in section 2.2 the tangential operators (gradient , divergence divγ, and Laplace-Beltrami ) as well as the Weingarten map; we also discuss -regularity for on surfaces of class . We introduce the distance function in section 2.3 and derive several important properties of it; this intrinsic approach avoids parametrizations and allows for implicit representions of . We devote section 2.4 to the second fundamental form of and its principal curvatures using both parametric and intrinsic approaches.
2.1. Parametric Surfaces
We assume that is a closed, compact, orientable manifold of class , , and co-dimension in . It can be represented parametrically by an atlas , where the individual charts are isomorphisms of class compatible with the orientation of ; the open connected sets are the parametric domains. Unless stated otherwise, it will be often sufficient to consider a single chart and resort to a partition of the unity. We thus drop the index for convenience. For , we set .
Let be the column vector of -th partial derivatives of for at . By definition, the rank of D{\boldsymbol{\chi}}({\bf y})=\big{(}\partial_{j}{\boldsymbol{\chi}}({\bf y})\big{)}_{j=1}^{n}\in{\mathbb{R}}^{(n+1)\times n} is (full rank). This implies that are linearly independent and span the tangent hyperplane to at .
The first fundamental form is the symmetric and positive definite matrix defined by
[TABLE]
If , then the components read
[TABLE]
which depends on the choice of parametrization. A normal vector to at can be written as , where and is the canonical basis of . In fact, since
[TABLE]
and for at least one because has rank , we deduce that
[TABLE]
is a well-defined unit normal vector to . Therefore, the matrix
[TABLE]
has rank and so is invertible. We write its inverse as
[TABLE]
and note that
[TABLE]
whence
[TABLE]
The last two equalities imply . Reversing the order of multiplication yields
[TABLE]
whence the projection matrix on the tangent hyperplane to has the form
[TABLE]
To obtain an explicit expression for note that
[TABLE]
This leads to the following useful expression of defined in (3):
[TABLE]
The area element is the ratio of the infinitesimal volume at and area of at , namely the volume of the parallelotope in the tangent plane to spanned by the vectors :
[TABLE]
To obtain a more familiar form of we argue as follows:
[TABLE]
because \det\big{(}[{\bf N},D{\boldsymbol{\chi}}]^{t}[{\bf N},D{\boldsymbol{\chi}}]\big{)}=|{\bf N}|^{2}\det(D{\boldsymbol{\chi}}^{t}D{\boldsymbol{\chi}})=|{\bf N}|^{2}\det{\bf g}. Moreover, exploiting that , we deduce
[TABLE]
An integrable function induces an integrable function by composition , or equivalently for all . The area element allows for integration over via the formula
[TABLE]
This definition does not depend on the parametrization: if are parametrizations of , then and whence
[TABLE]
2.2. Differential Operators
If a function is of class , we can define the tangential (or surface) gradient of the corresponding function as a vector tangent to that satisfies the chain rule
[TABLE]
Since is spanned by , we get for some whence and
[TABLE]
If is a vector field of class , we define its tangential differential as a matrix whose -th row is . If is of class , then the unit normal vector is of class and its differential
[TABLE]
is called the Weingarten (or shape) map of . In addition, the tangential divergence of is the trace of
[TABLE]
provided . If both and are of class , then the Laplace-Beltrami (or surface Laplace) operator is now defined to be
[TABLE]
The following lemma shows that (13) is designed to allow integration by parts on , exactly as it happens in flat domains with the Laplace operator .
Lemma 1** (weak form of the Laplace-Beltrami operator).**
If is of class with compact support in , then
[TABLE]
Proof.
In view of (8), which allows us to switch from to back and forth, we can write
[TABLE]
This proves (14) as desired. ∎
In view of (14), we are now in the position to introduce the weak formulation for the Laplace-Beltrami operator. We first define the space of square integrable functions on with vanishing mean value by
[TABLE]
and its subspace containing square integrable weak derivatives defined as for example in Section 3 of [JK95] by
[TABLE]
Our next result shows that the natural norm in is equivalent to the semi-norm . The proof essentially hinges on the Peetre-Tartar Lemma [Pee66, Tar78], but we proceed with a slightly more direct proof as in [Eva98, Section 5.8.1].
Lemma 2** (Poincaré-Friedrichs inequality).**
Let be a compact Lipschitz surface. There exists a constant only depending on such that
[TABLE]
Proof.
We prove by contradiction the more general estimate
[TABLE]
Suppose that there is a sequence such that
[TABLE]
as . We deduce that is uniformly bounded in . Since the embedding is compact (because is compact, see the proof of [Aub82, Theorem 2.34]), there is a Cauchy subsequence (with abuse of notation not relabeled) of in . This, together with , implies that is a Cauchy sequence in . Let be the limit of in , which yields whence is constant on . Moreover, whence . This gives rise to the contradiction , and finishes the proof. ∎
We emphasize that the Poincaré-Friedrichs constant depends on the surface . Later we shall consider perturbations of and derive Poincaré-Friedrichs type estimates on where the constant depends on provided the geometry of is minimally approximated by . This is proved in Lemma 18 for Lipschitz surfaces and only requires that the and norms on and are equivalent.
We will not deal explicitly with functionals in the dual space of , but occasionally need its norm for
[TABLE]
Lemma 2 (Poincaré-Friedrichs inequality) implies that . The weak formulation of reads: for , seek so that
[TABLE]
Since the Dirichlet bilinear form in (18) is coercive, according to Lemma 2, existence and uniqueness of a solution is a consequence of the Lax-Milgram theorem. We observe that thanks to the property , the solution satisfies
[TABLE]
It turns out that exhibits the usual regularity pick-up provided is of class .
Lemma 3** (regularity).**
If is of class , then there is a constant only depending on such that
[TABLE]
Proof.
We use a localization argument to the parametric domain. We assume, without loss of generality, that the atlas satisfies the following property: there exist domains such that and is still a covering of . Let now be a partition of unity associated with the covering . The functions satisfy
[TABLE]
In light of the estimate and (15) we deduce that . Recalling (13) we can rewrite in the parametric domain as
[TABLE]
and observe that this is a uniformly elliptic problem with coefficients. Applying interior regularity theory [Eva98], we deduce
[TABLE]
Therefore, adding over and using the finite overlap property of the sets , we end up with
[TABLE]
as asserted. ∎
In view of our discussion below of surfaces of class with , it is natural to ask whether the regularity estimate (20) is still valid in this more general context. We now show that this is indeed the case provided the surface is of class with , or equivalently the parametrizations and partitions of unity subordinate to the covering of are of class . In this case a Sobolev embedding implies is of class with .
Lemma 4** (regularity for surfaces).**
If is of class with , then there is a constant depending on and such that
[TABLE]
Proof.
We argue with one chart and thus suppress the index in , , etc. Since and , the right-hand side in the proof of Lemma 3 (regularity) satisfies
[TABLE]
On the other hand, the definitions (1) and (5) of the first fundamental form and area element imply that they are bounded in as well as
[TABLE]
Therefore, the Laplace-Beltrami equation in the parametric domain can be written in non-divergence form as follows:
[TABLE]
Since is uniformly continuous, the Calderón-Zygmund regularity theory applies (cf. [GT98, Theorem 9.15 and Lemma 9.17]) and gives the interior regularity with
[TABLE]
where and as in the proof Lemma 3 (regularity). Invoking Sobolev embedding again, we deduce
[TABLE]
and upon pasting these local estimates together over ; hence . We now iterate this argument and prove a recurrence relation by induction. Suppose that a sequence of real numbers is governed by the relations and
[TABLE]
and the right hand side of (22) satisfies ; note that this is the case for . Calderón-Zygmund theory thus implies with
[TABLE]
Sobolev embedding in turn yields whence , which proves the recurrence relation. Iterating these relations we see that for
[TABLE]
and that every step increases the value of , because . Since , the iteration stops once or equivalently
[TABLE]
This concludes the proof. ∎
2.3. Signed Distance Function
We now take advantage of the ambient space and use standard calculus in a suitable tubular neighborhood of to derive useful expressions of geometric quantities; we postpone momentarily the precise definition of . The surface splits into two disjoint sets, the interior and exterior of . The signed distance function is defined for every to be the distance of to , , if belongs to the exterior of and if belongs to the interior of , whence
[TABLE]
It turns out that belongs to the same regularity class as so long as is at least , which we henceforth assume in our discussion of . While the distance function exists for surfaces of regularity less than , as we explain in Section 2.5 below its properties are drastically different and it is not immediately useful for purposes of defining and analyzing surface FEM. Returning to the setting of surfaces, is well defined for all and computed on gives the unit normal pointing outwards:
[TABLE]
Since is defined in it provides a natural extension of to . This neighborhood is sufficiently small that for every there is a unique closest point projection defined by
[TABLE]
An important property is that coincides at and :
[TABLE]
Since , we deduce that the Hessian satisfies
[TABLE]
This implies that can be regarded as an operator acting on the tangent hyperplane to at and thus gives an alternative representation to the Weingarten map (11):
[TABLE]
This has two important consequences. First it provides a natural extension of to and second shows that is symmetric, which is not apparent from (11).
Given a generic function , the distance function provides a natural way to extend it to the neighborhood upon writing
[TABLE]
Differentiating and using the definition (3) of orthogonal projection, we obtain
[TABLE]
where the last equality hinges on (24), which implies and . In particular, \nabla\mathpzc{v}({\bf x})=\nabla_{\gamma}\widetilde{\mathpzc}{v}\big{(}{\bf P}_{d}({\bf x})\big{)} for because (26) provides a normal extension of .
Suppose now that is an extension of to , but not necessarily in the normal direction. An intrinsic definition of tangential gradient of is the orthogonal projection of to the tangent hyperplane of :
[TABLE]
This definition is consistent with (10): is orthogonal to and
[TABLE]
obeys the chain rule, whence it must coincide with our previous definition based on these two properties. An important consequence of this property follows.
Remark 5** (parametric independence).**
The definition (28) is independent of the extension: if are two extensions of then on and the only non-vanishing component of is in the normal direction . Since definitions (28) and (10) agree, we deduce that the tangential gradient is independent of the parametrization chosen to described . The same happens with the tangential divergence (12) as well as the Laplace-Beltrami operator (13), the latter because of (14) and the fact that (8) is independent of .
Given a vector field and corresponding extension to , the tangential divergence can be written as
[TABLE]
and gives an alternative expression to (12). Likewise, the Laplace-Beltrami operator , written parametrically in (13), can be equivalently written in terms of the extension as follows
[TABLE]
because . This implies the expression
[TABLE]
2.4. Curvatures
We again assume that is of class . In view of (11), the Weingarten map is symmetric and its eigenvalues are real. Except for the zero eigenvalue corresponding to the eigenvector , according to (25), they are called the principal curvatures of at and are denoted by for . The eigenvectors of corresponding to the principal curvatures are called the principal directions.
We stress that is well defined for all because so is . This allows us to make the definition of precise. Given , first let
[TABLE]
Let also
[TABLE]
We may now set
[TABLE]
Note that the distance function, closest point projection, and related properties are defined and hold on the larger set . We adopt the more limited definition of in order to avoid degeneration of some quantities such as curvature of parallel surfaces (see below) that occurs near the boundary of the larger set.
Given small so that , we define the parallel surface to be
[TABLE]
The following statement relates the principal curvatures of with those of .
Lemma 6** (curvatures of parallel surface).**
If is of class so are all parallel surfaces and their principal curvatures satisfy
[TABLE]
whereas the principal directions at and coincide.
Proof.
Differentiate (24) to get
[TABLE]
whence, since \nabla d({\bf x})=\nabla d\big{(}{\bf P}_{d}({\bf x})\big{)} again from (24),
[TABLE]
Therefore, for we see that the eigenvalues of \big{(}{\bf I}+\varepsilon D^{2}d\big{(}{\bf P}_{d}({\bf x})\big{)}\big{)} are
[TABLE]
according to (31). This implies that {\bf I}+\varepsilon D^{2}d\big{(}{\bf P}_{d}({\bf x})\big{)} is nonsingular and the previous relation reads as follows in terms of the Weingarten map:
[TABLE]
This shows that the eigenvectors of and {\bf W}\big{(}{\bf P}_{d}({\bf x})\big{)} coincide and the eigenvalues are related via (32). ∎
The second fundamental form of is defined by
[TABLE]
where the last equality relies on the fact that and are orthogonal for . The next result connects with the Weingarten map (11).
Lemma 7** (second fundamental form).**
The symmetric matrix defines a selfadjoint operator on the tangent hyperplane to that can be represented in the basis by the generally non-symmetric matrix
[TABLE]
The eigenvalues of are the principal curvatures of .
Proof.
Since , we can regard as an operator acting on the tangent plane to and represent its image in terms of as follows
[TABLE]
Let and multiply both sides by to see that
[TABLE]
This implies and thus the assertion. ∎
2.5. Surface regularity and properties of the distance function
In the previous two sections we have seen that when is of class , the closest point projection is uniquely defined in a tubular neighborhood of whose width is related to the principal curvatures of the surface. We shall see below that the closest point projection plays a pivotal role in analyzing finite element methods on surfaces. On the other hand, some applications may require solving PDE on surfaces that are less regular than . Thus it is natural to ask which properties of the distance function and closest point projection carry over to less regular surfaces. It turns out that the properties of these maps change drastically and fundamentally when crossing the threshold from to less regular ( with ) surfaces.
In order to make this statement precise, we begin by restating for comparison from [GT98, Lemma 14.16] some fundamental properties of the distance function for surfaces ().
Lemma 8** (properties of distance functions for surfaces).**
Let be a surface, . Then there exists a positive constant depending on such that . In addition, the closest point projection is defined and of class on with .
We now ask whether a similar statement holds for , and in particular for . Note first that the distance function to any closed set is defined and Lipschitz continuous [Fed59, Theorem 4.8.1], so the first question at hand is whether distance functions for surfaces ( are more than Lipshitz continuous.
In order to understand the relationship between surface regularity and the distance function map, we first define the reach of a surface :
[TABLE]
For a surface , we have already seen that . We now explore the connection between the reach and properties of the distance function for less regular surfaces. We first define
[TABLE]
The following result may be found in [Fed59, Theorem 4.8.3].
Lemma 9** (properties of differentiable distance functions).**
If is a surface, , and is differentiable at , then . In particular, if is differentiable in a neighborhood of , then .
Next we define several constants from the technical report [Luc57]. Given and , we first define the closed normal segment
[TABLE]
Let denotes the ball in of center and radius , and
[TABLE]
Combining [Luc57, Theorem 1] and noting that bounds the Lipschitz constant of (cf. the comment on p. 15 of [Luc57]), we have the following.
Lemma 10** (further properties of surfaces).**
If the surface is of class , then the constants , , , and are all equal. In addition, if then is of class .
Combining the previous lemmas with the statement in [Fed59, Theorem 4.18] that yields the following result.
Theorem 11** ( distance function implies surface).**
If the distance function associated to a surface is continuously differentiable in a tubular neighborhood of for some , then is of class . In addition, any surface with positive reach is of class .
The preceding results establish that the properties of the distance function and the associated closest point projection for surfaces that we previously discussed are inherently connected with surfaces of bounded curvature. This can be seen both in Theorem 11 (since the curvatures are defined and bounded almost everywhere on a surface) and in the definition of the constant (since for , the supremum over the radii for which is the inverse of the maximum principal curvature at ).
For our purposes, Theorem 11 is essentially a negative result in that it establishes that the distance function and closest point projection are of limited immediate use for surfaces that are less regular than . In particular, in this case the closest point projection is not uniquely defined on any tubular neighborhood of . In addition, the regularity of the distance function does not vary continuously with that of , since for a surface with Theorem 11 establishes that is only Lipschitz. Thus we must use different tools when considering surface finite element methods on less regular surfaces than .
2.6. Divergence Theorem on Surfaces
We conclude this section with an application of calculus in to derive an integration by parts formula on not necessarily closed surfaces.
Proposition 12** (divergence theorem).**
Let be a compact, oriented surface of class with Lipschitz boundary . Let be the total curvature of and be the unit outward normal to lying in the tangent hyperplane to . If , then
[TABLE]
Proof.
Given we define the tubular set
[TABLE]
note that for all . We decompose the boundary of into
[TABLE]
The sets are parallel surfaces to whereas is the lateral boundary of size . We first assume that is of class , let be an extension of to of class , and apply the divergence theorem in to obtain
[TABLE]
where is the unit outward normal of . We divide both sides of this equality by , the thickness of and compute the limits as . According to (27) we first see that
[TABLE]
Likewise
[TABLE]
Moreover, since , we infer that
[TABLE]
with and denotes the infinitesimal area associated with the surface . Since \frac{d}{d\rho}\nabla d\big{(}{\bf x}+\rho\nabla d({\bf x})\big{)}=D^{2}d\big{(}{\bf x}+\rho\nabla d({\bf x})\big{)}\nabla d({\bf x})=0, it remains to evaluate . We resort to (53) (shown below) with and use that as well as (32) to write
[TABLE]
We finally observe that
[TABLE]
to conclude the proof for of class . The assertion for follows by density of in . ∎
Applying Proposition 12 (divergence theorem) to a vector field and computing the trace yields the more familiar expression
[TABLE]
Corollary 13** (integration by parts).**
Let be a surface of class with Lipschitz boundary . If satisfy and , then
[TABLE]
Proof.
Apply the previous equality to . ∎
3. Perturbation Theory
In most surface finite element methods, the approximate problem is not posed on the continuous surface . This may occur either for convenience, or because is not known precisely. Examples of only incomplete information being present in simulations include free boundary problems such as two-phase flow and cases where is reconstructed from some sort of imaging data.
The purpose of this section is to investigate how geometric quantities change under perturbation of the surface . To this end, suppose that is a closed Lipschitz surface (not necessarily ). We use a subscript to denote geometric quantities associated with : (parametrization), (first fundamental form), (area element), (unit normal), (tangential gradient), and (orthogonal projection onto ).
Let solve (19) and solve
[TABLE]
for a given forcing . To examine the error between and , we first have to study how the bilinear forms in (19) and (33) change when changing . This amounts to deriving expressions for the error matrices in the error equations
[TABLE]
valid for all and the corresponding lifts. We carry out this program below within two scenarios depending on the regularity of . We alert the reader about the following abuse of notation: the matrix (resp. ) is defined in (resp. ), but we will often write them in the parametric domain thereby identifying (resp. ) with (resp. ).
3.1. Perturbation Theory for Surfaces
Let be of class and and be the parametrizations of and . They dictate the relation between and , the former defined on and the latter on ,
[TABLE]
In the sequel, we first establish a relation between and and next use it to characterize and .
Lemma 14** (relation between tangential gradients).**
If is of class , then the tangential gradients and satisfy
[TABLE]
Proof.
We concatenate (10) and (9) to write
[TABLE]
which is the first asserted expression provided is of class . Using the density of in for a surface of class , the first assertion follows. The second one follows similarly. ∎
Lemma 15** (geometric consistency).**
The error matrices and read on
[TABLE]
Proof.
Using (35), together with the definition (1) of , yields
[TABLE]
Since , according to (4), the first equality in (34) follows immediately. The proof of the second equality is similar. ∎
Our task now is to relate and with . We accomplish this next but first we introduce some additional concepts. For any , we denote by (resp. ) the largest (resp. smaller) singular value of . Given the relation , these quantities are the square roots of the largest and smallest eigenvalues of . We define the stability constant
[TABLE]
and point out that it is a measure of non-degeneracy of and . We further define the following relative measure of geometric accuracy
[TABLE]
Lemma 16** (error estimates for and ).**
The following error estimates are valid
[TABLE]
Proof.
Since , and
[TABLE]
the first assertion in (40) follows; the second one is similar. To prove (41), we write
[TABLE]
and note that where are the eigenvalues of . Utilizing the definitions of and we end up with
[TABLE]
Since is the sum of terms of the form multiplied by factors bounded by , we deduce
[TABLE]
This is the first assertion in (41) in disguise. The second one is similar. ∎
Lemma 17** (norm equivalence).**
Let and be Lipschitz surfaces which are related via a bi-Lipschitz map . Then there is a constant , depending on the stability constant in (38), such that
[TABLE]
Proof.
Use (9) and (10) in conjunction with (8). ∎
Lemma 2 (Poincaré-Friedrichs inequality) holds on the perturbed surface but with a constant depending on . In order to avoid this dependence, and thus obtain a uniform constant in , it is only necessary that Lemma 17 (norm equivalence) be valid. Before stating our result, we first define a class of surfaces. Given a Lipschitz surface , we let be the class of Lipschitz surfaces such that Lemma 17 (norm equivalence) holds with uniform equivalence constant . Note that implicit in this definition is the existence of a bi-Lipschitz bijection for each , for instance .
Lemma 18** (uniform Poincaré-Friedrichs constant).**
Given a Lipschitz surface , for every with there holds that
[TABLE]
with the constant hidden in depending only on and .
Proof.
We argue by contradiction the validity of
[TABLE]
and all with uniform constant . We thus assume the existence of a sequence of surfaces and functions such that
[TABLE]
as . We denote by the associated bi-Lipschitz bijections and by the lifts of the functions to . Since , the estimates of Lemma 17 (norm equivalence) hold with uniform constant for each , whence and
[TABLE]
as . Proceeding as in Lemma 2 (Poincaré-Friedrichs inequality), we deduce that a subsequence of , still denoted , converges in to a function with ; this implies that is constant. To show that , let be arbitrary and sufficiently large so that . Exploiting that is constant and , we use Lemma 17 to compute
[TABLE]
Applying again Lemma 17, now to the function , yields with constant depending only on , so that . Since is arbitrary, we must thus have . This contradicts because . Consequently, the desired statement is proved. ∎
Lemma 19** (perturbation error estimate for surfaces).**
Let solve (19) and solve (33). Then, the following error estimate for holds
[TABLE]
where the hidden constant depends on defined in (38).
Proof.
We proceed in several steps.
Step 1: error representation. Let and make use of (34) to write
[TABLE]
We next employ the equations (19) and (33) satisfied by and to obtain
[TABLE]
where we have also employed (8) to switch the domain of integration of .
Step 2: geometric error matrix. To derive a bound for , we rewrite
[TABLE]
Since , applying (40) and (41) leads to the error estimate
[TABLE]
Step 3: final estimates. The Cauchy-Schwarz inequality yields
[TABLE]
To derive a bound for , we first combine (17) with (33) to obtain , and next appeal to Lemma 17 (norm equivalence). On the other hand, we recall that has vanishing mean-value on , let be the mean-value of , and use (17) to arrive at
[TABLE]
Finally, applying Lemma 17 ends the proof. ∎
3.2. Perturbation Theory for Surfaces
Let be of class and the tubular neighborhood satisfy (31), namely
[TABLE]
so that parallel surfaces to within are also . We further assume that and the distance function projection is a bijection. The parametrizations of and are given by so that
[TABLE]
Lemma 20** (relation between tangential gradients).**
If is of class , then the tangential gradients and satisfy for all
[TABLE]
and
[TABLE]
Proof.
Let us assume that . Recalling (27) and (28), we readily get
[TABLE]
hence (49). Since is invertible for all , according to the definition (31) of and shown in Lemma 6 (curvature of parallel surfaces), (27) can be rewritten as
[TABLE]
To prove (50) we must relate and . First note that for
[TABLE]
Exploiting next that , because is constant in the normal direction to , yields
[TABLE]
Since , we deduce
[TABLE]
Inserting this into the previous expression for leads to (50). Finally, a density argument of in for of class concludes the proof. ∎
The following result mimics Lemma 15 (geometric consistency) except that now it quantifies the effect of perturbing the surface on the bilinear forms written in (34) in terms of .
Lemma 21** (geometric consistency).**
The error matrices in (34) are given on by
[TABLE]
Proof.
In view of (8), (49), and the fact that all matrices involved are symmetric and , we can write
[TABLE]
Noticing that the first equality on (34) follows immediately. The second equality proceeds along the same lines but using (50) instead. ∎
It is clear from Lemma 21 that the ratio of area elements matters. We next derive a representation for for any dimension , proved originally for in [DD07, Dem09]. We stress that, in view of Remark 5 (parametric independence), the solution of the Laplace-Beltrami equation (18) is independent of the parametrization of . This allows us to consider a convenient parametrization for theory because it does not change the geometric objects under consideration. We exploit this flexibility next.
Lemma 22** (relation between and ).**
Given any parametrization of , let be the parametrization of . If for all , then the ratio of area elements with satisfies
[TABLE]
Proof.
We start with the formula (5) for the area elements and to get
[TABLE]
We write for some and to be found. The identity yields while gives and
[TABLE]
To obtain an expression for , let and , and utilize the chain rule
[TABLE]
where we have argued as in (27). Compute now and use that together with to arrive at
[TABLE]
where . It thus remains to show that .
We now embark on a spectral analysis of . We first note that the statement is trivial if . We thus assume that are linearly independent and that the space is generated by two orthonormal vectors and . We consider the orthogonal decomposition and a rotation on that maps into , namely
[TABLE]
thus the rotation angle satisfies and . Consequently,
[TABLE]
The proof concludes upon realizing that and are eigenvectors of with eigenvalues and , and the remaining eigenvalues are with eigenspace . ∎
We are now ready to compare solutions and of (19) on two nearby surfaces and . In essence, weak solutions and are close in provided and are close in a Lipschitz sense. Therefore, to make this statement quantitative we introduce the following geometric quantities
[TABLE]
where is a Lipschitz surface. Our goal is to bound in terms of the forcing functions , and in (54).
Lemma 23** (perturbation error estimate for surfaces).**
Let solve (19) and solve (33) with . Let and be the parametrizations of and that give rise to the area elements and . If the normal vectors satisfy , then
[TABLE]
Proof.
We proceed along the lines of Lemma 19 (perturbation error estimate for surfaces) and realize that Steps 1 and 3 are exactly the same. Therefore, we only deal with the estimate of the geometric error matrix . If we prove
[TABLE]
then the assertion will readily follow. We first write with
[TABLE]
We now estimate these three terms separately. In view of (53) we deduce
[TABLE]
where . Since and , we readily obtain
[TABLE]
and a similar bound for because is bounded in thanks to the assumption . The desired estimate for follows from the fact that and are bounded. This property again, now combined with
[TABLE]
yields . Finally, term reads
[TABLE]
Since we infer that . This ends the proof. ∎
It is worth comparing Lemmas 19 and 23 (perturbation error estimates). To do so, we next give an estimate for in terms of .
Lemma 24** (error estimate for normals).**
The errors and defined in (54) and (39) satisfy
[TABLE]
where the hidden constant depends on defined in (38).
Proof.
In view of the definition (2) of , we realize that
[TABLE]
Since and is a sum of products of with times factors , we have
[TABLE]
We finally resort to , proved in (7), as well as , showed in the proof of Lemma 16, to conclude (58). ∎
We now stress the advantage of using the distance function lift to represent the error whenever the surface is of class . Comparing (46) and (55) we see that the geometric error becomes of order plus a quadratic term in rather than linear. In the context of finite element methods, is often a polyhedral approximation to having faces of diameter . In this case essentially becomes a Lagrange interpolation error measured in and a Lagrange interpolation error measured in . The former error is of order and the latter of order . Consequently, the perturbation error for surfaces is of order , whereas for surfaces with it is of order from the analysis of the previous subsection. The increased approximation order for surfaces is a superconvergence effect. We also recall from Theorem 11 ( distance function implies surfaces) that the elegant properties of the distance function and closest point projection that lead to this superconvergence effect are not available when is not of class , thus the necessity of developing a separate perturbation theory for less regular surfaces as in the previous subsection. It is not clear whether the order of the perturbation error actually jumps in this manner when crossing from to surfaces, or if this jump is an artifact of proof.
3.3. extensions from surfaces
The analysis of the trace and narrow band methods that we carry out in later sections requires us to extend the solution of (19) to tubular neighborhoods with the property
[TABLE]
we recall that is defined in (29). The distance function lift provides a natural way to achieve this upon setting , namely
[TABLE]
However, this is problematic because it requires to be of class , and thus of class , for (59) to hold. We now construct an extension that satisfies (59) for of class . Our approach employs a regularization of the signed distance function and construction of a regularized surface close to , with the regularization parameter appropriately related to the desired value of above. We begin by describing properties of this regularization.
Regularization. Recall that given of class there exists a sufficiently thin tubular neighborhood so that the signed distance function to satisfies . Let and be sufficiently small so that the tubular neighborhood of width satisfies the property
[TABLE]
Let be the ball of center [math] and radius , be a smooth and radially symmetric mollifier with support in and
[TABLE]
be a regularized distance function. This function induces the smooth surface
[TABLE]
but is not the signed distance function to , which we denote . The following properties are immediate from the previous definitions.
Lemma 25** (properties of ).**
If , then satisfies
[TABLE]
and . Moreover, the surface is smooth and the Hausdorff distance between and satisfies
[TABLE]
provided is small enough so that for a suitable constant .
Proof.
Since is radially symmetric, we have that
[TABLE]
and
[TABLE]
These relationships imply the first assertion upon employing a Taylor expansion of and the Lipschitz nature of , respectively. We also note that
[TABLE]
because in view of the radial symmetry of . The second relationship bounding then follows from the Lipschitz nature of (i.e. , ) and the standard property of the mollifier.
To establish the smoothness of , note that the closeness of and implies that is nondegenerate for . The smoothness of then follows from the implicit function theorem.
The last assertion is a consequence of the nondegeneracy of the distance function: Given let be the closest point to and note that
[TABLE]
Likewise, given let . There is such that . To see this, note that for and
[TABLE]
provided ; similarly . Letting be such that , we note that , and so arguing as before we have that
[TABLE]
which concludes the proof. ∎
We recall that is the signed distance function to the zero level set of . Consider the lift
[TABLE]
It is natural and useful for later considerations to compare tubular neighborhoods dictated by and . Let
[TABLE]
where we choose as follows depending on and . Given let be the point at shortest distance, whence , and let be a point such that which is guaranteed to exist because in view of Lemma 25 (properties of ). Therefore
[TABLE]
provided ; note that . This implies
[TABLE]
Similarly, using again in conjunction with Lemma 25 yields
[TABLE]
The next lemma and corollary study important properties of and , in particular how derivatives degenerate with .
Lemma 26** (properties of ).**
The function and satisfies
[TABLE]
Moreover, the following error estimates hold
[TABLE]
Proof.
Since and for all , fix and a system of coordinates such that is a generic point and points in the -th coordinate direction. The Implicit Function Theorem guarantees the existence of a ball in centered at and a function such that
[TABLE]
In other words, is locally described in as a graph for . It is not difficult but tedious to see that
[TABLE]
which translates into the first estimates for
[TABLE]
To prove the error estimates, let and note that
[TABLE]
with and . Hence,
[TABLE]
because of (61). Since , we now write
[TABLE]
and estimate pairs of terms on the right hand side separately. Since , we get
[TABLE]
and using Lemma 25 (properties of ) we also obtain
[TABLE]
whence the first error estimate follows
[TABLE]
To show the desired second error estimate we observe that \big{|}1-\nabla d({\bf x})\cdot\nabla d_{\varepsilon}({\bf x})\big{|}=\frac{1}{2}\big{|}\nabla d({\bf x})-\nabla d_{\varepsilon}({\bf x})\big{|}^{2}. This concludes the proof. ∎
Corollary 27** (property of ).**
The lift belongs to and satisfies
[TABLE]
for suitable constants so that and .
Proof.
Differentiate the -th component of with respect to and to obtain
[TABLE]
whence invoking Lemma 26 (properties of ) yields
[TABLE]
because of and (61). This completes the proof. ∎
Given a function we are now ready to introduce an extension to . For this, we assume that is sufficiently small so that (61) is valid. We first define the auxiliary function , where , and then the extension , namely
[TABLE]
Consequently, we realize that . We introduce the notation to avoid confusion between and the identity. We recall that the coarea formula
[TABLE]
is valid for any integrable function [Theorem 3.14, Evans and Gariepy]. We will use this formula next and later in this chapter.
Proposition 28** ( extension).**
Let and be as in Corollary 27 (property of ), and assume that for a sufficiently small constant . If , then and
[TABLE]
Moreover, the trace of on coincides with , that is an extension of .
Proof.
In view of (27), the -partial derivative of reads
[TABLE]
where stands for the -component of . We use again (27) to obtain
[TABLE]
Setting and applying Lemma 26 (properties of ) yields
[TABLE]
We reduce the computation of integrals in the bulk to integrals on parallel surfaces via the coarea formula (63). Since in view of (61) the co-area formula implies
[TABLE]
Lemma 17 (norm equivalence) immediately yields
[TABLE]
In order to relate second derivatives of on to those of on , we apply (50) with playing the role of and . Then
[TABLE]
and after applying this formula again to we obtain
[TABLE]
where . We thus wish to bound . First we note that combining the bound on the Hausdorff distance between and from Lemma 25 (properties of ) with from Lemma 26 (properties of ) yields for that the eigenvalues of are bounded by , which is less than under the assumption that is sufficiently small; thus . In addition, combining the same assumption with and Lemma 26 yields
[TABLE]
so that and
[TABLE]
thus . In order to bound the derivatives of , we note that for a matrix there holds . For , we use Lemmas 25 and 26, , and the assumption to deduce in
[TABLE]
Since we have already established that , we infer that . A similar calculation for , while recalling that , yields and, after applying Lemma 17 (norm equivalence), gives
[TABLE]
The asserted estimate follows from applying again the co-area formula (63), which leads to
[TABLE]
Finally, we take , note that , and compute
[TABLE]
to realize that is indeed an extension of to . ∎
We now derive the elliptic PDE’s satisfied by on and in . For , let and consider the extension to
[TABLE]
Lemma 29** (PDE satisfied by ).**
If is closed and of class , then is also closed and of class , and the extension satisfies on
[TABLE]
where {\widetilde{\mathbf{A}}_{\varepsilon}}:=\big{(}{\bf I}-d_{\varepsilon}\,D^{2}d_{\varepsilon}\big{)}\Pi\big{(}{\bf I}-d_{\varepsilon}\,D^{2}d_{\varepsilon}\big{)}\circ{\mathbf{Q}_{\varepsilon}}, stands for the orthogonal projection on and reads
[TABLE]
Proof.
Given , let . We resort to (49) to write
[TABLE]
because . This combined with (8) and Corollary 13 (integration by parts) on the closed surface yields
[TABLE]
with given by (53). Likewise,
[TABLE]
Since the last two equalities hold for all , the assertion follows. ∎
We extend the function to as follows:
[TABLE]
Equivalently, given let be the unique point such that for some
[TABLE]
Proposition 30** (PDE satisfied by ).**
Let and be as in Corollary 27 (property of ). The extension of of Proposition 28 satisfies the PDE
[TABLE]
where
[TABLE]
* with given in Lemma 29, , is given by*
[TABLE]
and is defined in Lemma 29.
Proof.
We proceed as in Proposition 28 ( extension). Let be a parallel surface to at distance , and let with so that (61) holds. We first employ (50) to obtain the bilinear form for on . For sufficiently small Lemma 26 (properties of ) guarantees that \big{(}{\bf I}-d_{\varepsilon}\,D^{2}d_{\varepsilon}\big{)} is invertible in . Hence, if {\mathbf{D}_{\varepsilon}}=\big{(}{\bf I}-d_{\varepsilon}\,D^{2}d_{\varepsilon}\big{)}^{-1}\Pi_{\varepsilon} and , we restrict to , define the auxiliary function and observe that (50) reads on
[TABLE]
where is the full gradient of ; this is because of the presence of the projection matrix on the tangent hyperplane to in the definition of . We get
[TABLE]
where is given in Lemma 29 (PDE satisfied by ) and is the surface measure density on due to the change of variables, namely
[TABLE]
according to (53). Similarly, the linear form for the forcing reads
[TABLE]
Since the left hand sides of the previous integral expressions coincide, in view of Lemma 29, we now integrate over and use the co-area formula (63) to convert the resulting integrals into bulk integrals
[TABLE]
because in . Since according to (61), integration by parts gives
[TABLE]
whence the desired PDE follows after noticing that \big{(}{\bf I}-d_{\varepsilon}\,D^{2}d_{\varepsilon}\big{)}^{-1} and commute. This completes the proof. ∎
4. Parametric Finite Element Method
The parametric method hinges on a surface approximation “interpolating” the exact surface . Recall that the latter is assumed to be a closed, compact, orientable hypersurface in . In the lowest order case of piecewise linear polynomials, this corresponds to a polyhedral surface whose vertices lie on or, more generally, sufficiently close to . The finite element space is then obtained in a classical way by mapping a finite element triplet defined on a reference element in to a facet of in . The FEM requires a bi-Lipschitz map which is not necessarily the distance function lift . The latter is used for numerical analysis purposes only even for smooth surfaces.
There are two sources of error: the approximation of the exact surface by the polyhedral surface , the so-called geometric consistency error, and the Galerkin error arising from the actual finite element approximation on . In this section we quantify these two errors depending on the regularity of . For the former we rely on the discussion of section 3 that addresses the effect of perturbing . For of class we deal with a generic lift and obtain a suboptimal geometric consistency error. For surfaces, instead, we resort to for error analysis and restore geometric optimality.
4.1. FEM on Lipschitz Parametric Surfaces.
Lipschitz Parametric Surfaces. We adopt the viewpoint that the surface is described as the deformation of an -dimensional polyhedral surface by a globally bi-Lipschitz homeomorphism . Thus there exists such that for all
[TABLE]
If is , we may take , but our current definition allows for much more flexibility in the choice of . For example, if has nonempty boundary and is given as the graph of a function with , then the map between with and could be given by , i.e., the “vertical” graph map.
The (closed) facets of are denoted by , and form the collection . We assume that these facets are all simplices and denote by the set of interior faces of . Extension to other element shapes such as -quadrilaterals and to nonconforming discretizations is possible under reasonable assumptions with minor modifications, but we do not elaborate them further. We let be the restriction of to . The partition of induces the partition of upon setting
[TABLE]
Note that this non-overlapping parametrization of allows for Lipschitz surfaces rougher than globally . We additionally define macro patches
[TABLE]
Let and be the triangulation shape-regularity constant, i.e.
[TABLE]
We further assume that the number of elements in each patch is uniformly bounded. This assumption automatically follows from shape regularity for triangulations of Euclidean domains, but the situation is more subtle for surface triangulations as illustrated in Figure 1. Such a bound does for example hold if is obtained by systematic refinement of an initial surface mesh with a uniform bound on the number of elements in a patch [DD07], or more generally using adaptive refinement strategies [BCM*+*16, BCMN13]. In addition, this implies that all elements in have uniformly equivalent diameters, as it happens for shape regular triangulations on Euclidean domains.
To provide a parametric description, let be the unit reference simplex, sometimes called the universal parametric domain. We denote by the affine map such that and note that (66) implies
[TABLE]
Hereafter we omit to specify when the constants (possibly hidden in signs) depend on . As pointed out in [BP12], even if the initial surface approximation satisfies (67), this property might not hold for refinements unless the initial polyhedral surface approximates the exact surface well. We refer to [BCM*+*16, BCMN13] for a discussion on how to circumvent this in an adaptive strategy. However, since this work focusses on a-priori and a-posteriori error estimation rather that adaptivity, we assume (67) directly.
We are now ready to introduce the local non-overlapping parametrization of . Let be the corresponding local parametrization of and ; see Figure 2. We record for latter use that thanks to the Lipschitz properties (64) and (67), also satisfies
[TABLE]
It turns out that it will be convenient to consider to be defined on a larger domain than , say , so that is a bi-Lipschitz local parametrization of : there exists a universal constant such that for each fixed and for all ,
[TABLE]
in this case is an overlapping parametrization of . We further assume that for all vertices of , so that is the nodal Lagrange interpolant of into linears.
We finally note that a function defines uniquely two functions and via the maps and , namely
[TABLE]
Moreover, each one of these functions induces the other two uniquely. Accordingly, we will use the symbol for all three functions if no confusion arises.
Differential Geometry on Polyhedral Surfaces. We use the atlas , induced by the non-overlapping parametrization , to describe in the spirit of Section 2. Likewise, we employ the atlas to describe the polyhedral surface . In view of (68), the discrete first fundamental form and area element of are given elementwise by
[TABLE]
and satisfy
[TABLE]
They give rise to the piecewise constant functions and . Similar properties are enjoyed by , which imply that the stability constant defined in (38) is purely geometric and independent of meshsize:
[TABLE]
In addition, notice that (68) and (69) imply that
[TABLE]
for constants , independent of discretization parameters. Moreover, the vector {\bf N}_{T}:=\sum_{i=1}^{n+1}\det\big{(}[{\bf e}_{j},D{\bf X}_{T})]\big{)}{\bf e}_{j} is perpendicular to provided are the canonical unit vectors of . This vector satisfies and yields the unit normal to
[TABLE]
and corresponding piecewise constant unit normal vector to .
Given a function , its tangential gradient and Laplace-Beltrami operator over obey the formulas
[TABLE]
and
[TABLE]
where is defined in (70). The strong form of is well defined only elementwise because is piecewise constant and so discontinuous over . To find the correct strong form we start from the weak form (19), split the integral over elements and use Corollary 13 (integration by parts) to obtain
[TABLE]
where the jump residual is computed over each face of elements of via
[TABLE]
and are such that and are the restrictions of and the outer unit normal to which is parallel to . We then see that consists of the absolutely continuous part (76) with respect to surface measure defined elementwise and the singular part (77) supported on the skeleton of . This formula makes sense for functions which are piecewise and globally , such as continuous piecewise polynomials.
Parametric Finite Element Method. In this work, we focus on continuous piecewise linear finite elements and polyhedral surface approximations. Let be the space of linear polynomials and let be the space of continuous piecewise linear polynomial functions over , namely
[TABLE]
The finite element space associated with the Laplace-Beltrami equation over is the restriction of to functions with vanishing mean
[TABLE]
We define to be the Lagrange interpolation operator and use the same notation for vector-valued functions.
We are now ready to introduce the parametric FEM: seek that solves
[TABLE]
where is an approximation of to be specified later. Lax-Milgram theory guarantees that is well defined. Observe that because , we also have
[TABLE]
Since the exact problem (19) and discrete problem (79) are defined on different domains and , the error does not satisfy Galerkin orthogonality in either one. The next statement accounts for geometric inconsistency and uses the convention (70) for the generic lift .
Lemma 31** (Galerkin quasi-orthogonality).**
Let and be defined in (36) and (37) via the parametrizations and . Then, for all , there holds
[TABLE]
and
[TABLE]
Proof.
We only prove (80) as (81) follows similarly. Using the equation (79) satisfied by and the consistency relation (34), we obtain
[TABLE]
The first term on the right-hand side equals , in view of (19) and (8), and thus yields (80). ∎
4.2. Geometric Consistency
In this section we study the error inherent to approximating with . The polyhedral surface is always represented by a lift whose regularity depends on that of . We present two scenarios depending on such regularity. We first assume that is piecewise and globally Lipschitz, and later assume that is and exploit the distance function lift to improve the error estimates.
Uniform Poincaré-Friedrichs estimate on . The analysis below takes advantage of the uniform Poincaré-Friedrichs estimate on
[TABLE]
where the constant hidden in the above inequality is independent of . Note that when is of class , , Lemma 18 (uniform Poincaré-Friedrichs constant) implies that (82) follows from (73) and (74), which in turn are consequences of assumption (64). Furthermore, when is of class and , the discussion in Section 3.2 yields conditions which are also easy to verify: and on .
Geometric Estimators. Since is described by and by it is natural to consider the difference as a measure of geometric mismatch [BCM*+*16]. We thus start with the geometric element indicator
[TABLE]
and the corresponding geometric estimator
[TABLE]
We have seen that the relative measure of accuracy (39) controls the geometric error. In this vein, we observe that because , whence such measure satisfies
[TABLE]
with a stability constant according to (38). Therefore is expected to dominate the geometric error for surfaces of class with . This is consistent with Lemma 19 (perturbation error estimate for surfaces).
For surfaces, however, is suboptimal in that it overestimates the influence of geometry [BD19]. According to Lemma 23 (perturbation error estimate for surfaces) and Lemma 24 (error estimates for normals), the following quantities should play a crucial role in dealing with geometry via the auxiliary lift
[TABLE]
and
[TABLE]
we stress that is formally of higher order than . We will show below that indeed controls the geometric error and accounts for the “superconvergence” property associated with the projection along the normal direction to alluded to at the end of section 3.2.
Geometric Consistency Error for Surfaces. We now quantify the geometric error incurred when replacing by its polygonal approximation .
Corollary 32** (geometric consistency errors for surfaces).**
If and satisfy (67) and (68), then for all we have
[TABLE]
where the hidden constants depend on defined in (38). Moreover,
[TABLE]
Proof.
We first point out that (67) and (68) yield according to (73). The asserted estimates follow from Lemma 16 (error estimates for and ) and Lemma 24 (error estimate for normals) in conjunction with (47) and (85). ∎
Geometric Consistency Error for Surfaces. We now take advantage of the lift for error representation. We recall that, as in section 3.2, the parametrizations of and are given by and . In particular, the infinitesimal area element of is defined using and so are the consistency matrices , ; see (51), (52). To improve upon Corollary 32 (geometric consistency errors for surfaces) we need more stringent geometric assumptions than simply . These assumptions are somewhat technical but are checkable computationally with information extracted from but without access to [BD19]. We list them now.
- •
Distance between and . Invoking the closest point property of the distance function projection and the definition (86) of , we see that for all . We thus assume that is sufficiently close to in the sense that
[TABLE]
according to (48). Therefore, the estimates of section 3.2 are valid. Moreover, the discrepancy between the two lifts satisfies for all
[TABLE]
- •
Mismatch between and . We assume that
[TABLE]
where is the patch around within . If for , then
[TABLE]
and all . Since is of class , we expect as and realize that (91) is always valid asymptotically. We emphasize that it is possible to check (91) computationally without accessing [BD19].
Corollary 33** (geometric consistency errors for surfaces).**
If (90) and (74) hold, then so do the following estimates for all
[TABLE]
where all the geometric quantities are defined using the parametrizations and . Moreover,
[TABLE]
Proof.
The first estimate in (93) is trivial from the definition (86) of , whereas the second estimate in (93) is a consequence of (58). The third estimate in (93) results from (57) and (58). With these estimates at hand, the estimate for in (94) comes from (56) and that for is similar. ∎
We conclude with a technical result assessing the mismatch between and . We motivate it with the following simpler -estimate valid for all
[TABLE]
This is a trivial consequence of the property (92) for
[TABLE]
The estimate below is -based and its proof entails regularization by convolution [BD19, Lemma 3.4].
Proposition 34** (mismatch between and ).**
Assume that (67) as well as the assumptions (74), (90) and (91) hold. Then there exists such for and we have
[TABLE]
provided and is a patch in around .
Proof.
We proceed in several steps.
Step 1: Reduction to . Fix and recall that satisfies (68) and maps the reference patch into . For notational ease, let
[TABLE]
Given , let , and note that because is Lipschitz. We change variables via to and invoke the non-degeneracy property (42) to obtain
[TABLE]
The assumption given in (91) is equivalent to and is sufficient to ensure that the quantity on the right hand side is well-defined.
Since is defined on , and its boundary is Lipschitz, there is a universal extension operator which is bounded both in and in the -seminorm [Ste70]; this is the so-called Calderón operator. We relabel to be , and thus assume it is bounded in while satisfying
[TABLE]
Step 2: Mollification. We now regularize by convolution with a standard smooth mollifier supported in the ball centered at [math] with radius to be determined. If is an arbitrary domain, it is well known that
[TABLE]
We may now write, without restriction on , that
[TABLE]
We estimate the first term using the first formula above for the mollifier
[TABLE]
Similarly, changing variables via the map , which turns out to be Lipschitz in view of (42) and (68), and applying the restriction stated in (91), we find that
[TABLE]
Step 3: Estimate for . Let be a lattice on with minimum distance between and () proportional to and such that covers . The set then has finite overlap for any , with the maximum cardinality of the overlap depending on . We choose
[TABLE]
Applying the second property of mollifiers given above yields
[TABLE]
whence
[TABLE]
Step 4: Bound on . Making use of the bi-Lipschitz character (68), we get
[TABLE]
where . Recalling (92) and the definition of , we thus obtain
[TABLE]
We now gather the estimates of Steps 2 and 3. Mapping from to and back via , and utilizing (42) and (68), yields
[TABLE]
This completes the proof. ∎
We conclude this section with a variant of Proposition 34 (mismatch between and ) which turns out to be instrumental for the study of the Narrow Band method discussed later in Section 6.
Proposition 35** (Lipschitz perturbation).**
Let be Lipschitz bounded domains and be a bi-Lipschitz isomorphism. If
[TABLE]
is sufficiently small so that then for all we have
[TABLE]
Proof.
We now proceed as in Proposition 34: let and be a regularization of by convolution with a standard smooth mollifier supported in the ball . We write
[TABLE]
and note that
[TABLE]
because is Lipschitz. To estimate , we argue as in Step 3 of Proposition 34 (mismatch between and ). This completes the proof. ∎
4.3. A-Priori Error Analysis
In this section we derive a-priori error estimates in and , namely estimates expressed in terms of regularity of the exact solution of (18). Compared to the existing literature these estimates involve two lifts: and . The former, based on the distance function , is only used theoretically or to define a notion of error when comparing with . The latter is generic and used in practice to define the finite element method, i.e., by setting and the discrete parametrization to be the interpolant of the continuous one . Optimal orders of convergence are derived without the need to access the distance function.
We also address a gap in the literature. Existing proofs of optimal a priori estimates for surface FEMs employ the distance function lift . However, when is , this map is only because of the presence of in its definition. Thus given , its extension to is only in and not piecewise in as is needed to prove optimal approximation order. Thus existing proofs that only employ the distance function lift require the assumption that be of class in order to obtain optimal order error estimates in the standard way; cf. the work of Dziuk in [Dzi88] in which such error estimates were originally obtained.
As pointed out already in Theorem 11 ( distance function implies surface), the distance function to a surface is no better than Lipschitz in general. Therefore, the aforementioned strategy does not extend to surfaces. However, the best approximation property of the Galerkin method together with the geometric consistency estimates of Section 4.2 yields a-priori error estimates in . We present this discussion after that for surfaces.
A-Priori Error Estimates for Surfaces. The following lemma will be instrumental to prove optimal a priori error estimates for of class . It states that a function can be approximated in to first order for a function . The difficulty is that the composite function whereas . The proof exploits this property to restore optimal approximability of in .
Lemma 36** (approximability in ).**
Let be a surface of class and . Let be defined in (30) and be given in (86). Then we have
[TABLE]
Proof.
We know from Veeser [Vee16] that continuous and discontinuous piecewise polynomial approximations in are equivalent. Even though this crucial result was originally proved for Euclidean domains, it proofs carries over with essentially no changes to the case of surface meshes
[TABLE]
We refer to [CD15] for related results on surfaces. We thus fix and argue over this element hereafter; recall that .
Applying the triangle inequality yields
[TABLE]
Using (49), we next find that
[TABLE]
which along with (44) yields
[TABLE]
Next note that is constant over . Therefore, in because implies and is . In addition, is a tangent vector field on . On the other hand, maps the affine functions onto the subspace of tangent to , so standard approximation theory leads to
[TABLE]
for any tangent vector field to . Using that and is bounded because is of class , together with the fact that is constant in , we deduce
[TABLE]
where we used the notation . This completes the proof. ∎
This proof reveals that (95) can in fact be written locally:
[TABLE]
We now apply Lemma 36 (approximability in ) to derive an a-priori error estimate. We present two proofs. The first one is very compact and relies on Lemmas 19 and 23 (perturbation error estimate). The second proof is selfcontained and paves the way to the error estimate that follows. In both cases we rely on Lemma 3 (regularity) for of class and :
[TABLE]
Theorem 37** ( a-priori error estimate for surfaces).**
Let be of class , and be the solution of (18). Let be the solution to (78) with defined via the lift . If the geometric assumptions (69), (90), and (91) are valid, then
[TABLE]
as well as
[TABLE]
Proof 1. We prove the second estimate. Let and solve (33)
[TABLE]
Since is the Galerkin approximation to on , we infer that
[TABLE]
This combined with the triangle inequality yields
[TABLE]
Applying Lemma 36 (approximability of ), together with , readily gives
[TABLE]
To estimate the remaining term, we resort to Lemma 17 (norm equivalence), Lemma 23 (perturbation error estimate) along with Corollary 33 (geometric consistency errors for surfaces) to obtain
[TABLE]
where denotes the area element induced by the parametrization of . We denote by the inverse of restricted to , and use Proposition 34 (mismatch between and ), with and , to get
[TABLE]
Combining the previous inequalities with completes the proof of the second assertion. The proof of the first one proceeds along the same lines but using Lemma 19 (perturbation error estimate for surfaces) and Corollary 32 (geometric consistency for surfaces) instead. ∎
Proof 2. We closely mimic the proof of Lemmas 19 and 23 (perturbation error estimate) for the solution to the Laplace-Beltrami problem on nearby surfaces, with an additional step needed due to the Galerkin approximation. In addition, the fact that is defined using the map while all other quantities are lifted using the closest point projection adds a twist to our proof as compared with standard proofs of such error estimates. We let for all for notational convenience, and focus on the second assertion.
Step 1: Error representation. For arbitrary, we let to arrive at
[TABLE]
We now invoke Lemma 31 (Galerkin quasi-orthogonality) to rewrite the first term as follows:
[TABLE]
where the area element over is induced by the parametrization . We thus have the error representation formula
[TABLE]
and estimate the three terms on the right hand side separately.
Step 2: Geometric and interpolation errors. According to Corollary 33 (geometric consistency errors for surfaces), the error matrix satisfies . This, together with Lemma 17 (norm equivalence) and the a priori bound , yields
[TABLE]
On the other hand, we can choose so that Lemma 36 (approximability in ) holds, whence
[TABLE]
Step 3: Final estimates. We recall that the discrete forcing is given by , where is the area element in induced by the parametrization . Changing variables to via the lifts and for each integral in gives
[TABLE]
where again denotes the inverse of restricted to . Since has vanishing mean over , we can assume that so does over . This allows us to invoke (82) (uniform Poincaré-Friedrichs constant) to deduce and thus apply Proposition 34 (mismatch between and ) to obtain
[TABLE]
Collecting the previous estimates, and using that , leads to
[TABLE]
because according to the definition (87) of and Corollary 33 (geometric consistency for surfaces). Invoking again Lemma 36 (approximability in ) yields the second assertion.
The first statement follows similarly upon replacing by , by and invoking Corollary 32 (geometric consistency errors for surfaces)
[TABLE]
This concludes the proof. ∎
Comparing Corollary 32 (geometric consistency errors for surfaces) with Corollary 33 (geometric consistency errors for surfaces) ones sees that using the distance function lift for error representation gives rise to a quadratic geometric error estimator for surfaces of class
[TABLE]
even though the FEM is designed in terms of a generic lift also of class . Meanwhile the geometric estimator is linear for this regularity class. This does not affect the a-priori error analysis for piecewise linear approximations of and , which is first order, but it is crucial to derive optimal second-order error estimates by a duality argument. We present next such estimates for surfaces of class and a FEM based on a generic lift also of class , a result that seems to be new in the literature.
Theorem 38** ( a-priori error estimate for surfaces).**
Let be of class and be described by a generic lift of class . Let the geometric conditions (69), (90), and (91) be satisfied. Let solve (19) and solve (78) with . Then
[TABLE]
provided , where is as in Proposition 34.
Proof.
We employ a standard duality argument, but enforcing compatibility (mean-value-zero) conditions. We use the lift and its inverse when restricted to to switch from to back and forth. To this end we use the notation and for functions and . We denote the area element induced by . We finally observe that if is of class then
[TABLE]
where and are defined in (86) and (87). We split the proof into several steps.
Step 1: Duality argument. We associate with the function with vanishing mean over and let satisfy
[TABLE]
Observe that the Lax-Milgram lemma and Lemma 2 (Poincaré-Friedrichs inequality) guarantee existence and uniqueness of . Let also be the Galerkin approximation to over , that is
[TABLE]
where has vanishing mean over . Note also that is a compatible right-hand side for Theorem 37 ( a-priori error estimate). We thus have
[TABLE]
Applying Lemma 31 (Galerkin orthogonality) the second integral becomes
[TABLE]
with . Changing variables first via the lift and next via , we get
[TABLE]
Consequently, we have derived the following error representation:
[TABLE]
The first term is standard and the next two account for the mismatch between and and geometric consistency. We examine them separately now.
Step 2: Bounds. Since is of class , Lemma 3 (regularity) gives for
[TABLE]
Combining Theorem 37 ( a-priori error estimate) for with Lemma 17 (norm equivalence) yields the following estimate in instead of
[TABLE]
Applying Theorem 37 again, this time for , implies
[TABLE]
On the other hand, Proposition 34 (mismatch between and ) with leads to
[TABLE]
because has a zero mean on . Since is of class , one sees that . Hence the a-priori bound implies
[TABLE]
Finally, Corollary 33 (geometric consistency error for surfaces), in conjunction with Lemma 17 (norm equivalence), allows us to tackle the geometric error
[TABLE]
where again we have used a priori bounds for and . Lemma 17 (norm equivalence) and the nondegeneracy property (74) of imply that . Collecting the previous estimates and dividing through by , we thus arrive at
[TABLE]
Step 3: Discrepancy between and and final estimates. We still need to deal with the discrepancy between and . Using Lemma 33 (geometric consistency errors for surfaces) and Lemma 17 again, we find that
[TABLE]
Applying the triangle inequality followed by Lemma 17 gives the intermediate estimate
[TABLE]
To conclude the proof, we simply note that
[TABLE]
according to Proposition 34 (mismatch between and ) and the estimate for of class (see definition (86) of ). Finally, the triangle inequality leads to the asserted estimate. ∎
The estimate (97) is known for surfaces of class and the distance function lift [Dzi88]. We insist that (97) appears to be new even for for surfaces of class and is optimal both in terms of regularity of and as well as order.
The regularity of enters in three distinct places in Step 2 of the proof to tackle the right hand side of (98) as well as in Step 3. The first instance is via Lemma 3 (regularity) to handle the regularity of both and in terms of the norm of the forcing terms: it turns out that (20) becomes
[TABLE]
whence the factor appears. The same happens with the term involving in view of (94), whereas a factor shows up for the middle term in (98) and the end of the proof due to Proposition 34 (mismatch between and ). The complete estimate thus reads
[TABLE]
A-Priori Error Estimates for Surfaces. We end this section proving error estimates for surfaces of class and solutions of class for . We recall Lemma 4 (regularity for surfaces) that establishes this regularity for , provided , along with
[TABLE]
In general, however, the relation between and is not well understood; we refer to [BDO] where it is proved the existence of such that . We start with a variant of Lemma 36 (approximability in ).
Lemma 39** (approximability in ).**
Let be a surface of class and , where or . Then we have
[TABLE]
Proof.
We recall that and , according to (35), and that and are uniformly of class ; here . Given , a direct calculation using the definition of the seminorm shows that the composition of a Lipschitz map with a function as well as the product of a function with a function belong to provided or . Consequently, we infer that for all along with
[TABLE]
A scaling argument guarantees that the constant hidden in this inequality is independent of . We next apply the localized interpolation estimate of Vesser [Vee16] to deduce
[TABLE]
which is the asserted estimate. ∎
We now compare Lemma 39 with Lemma 36 (approximability in ). We stress that the lift is of class for surfaces of class , whereas the distance lift is just of class for surfaces of class . This is why the proof of Lemma 39 is considerably simpler than that of Lemma 36. The virtue of is reflected in a higher order geometric error in Theorem 37 ( a-priori error estimate for surfaces) relative to the next error estimate. This is also responsible for the optimal Theorem 38 ( a-priori error estimate for surfaces) which does not have a counterpart in this context.
Theorem 40** ( a-priori error estimate for surfaces).**
Let be of class , , and assume that the geometric assumptions (69), (90), and (91) are valid. Let and be the solution of (18) and satisfy
[TABLE]
provided or . If is the solution to (78) with defined via the lift , then
[TABLE]
Proof.
We proceed along the lines of Proof 1 of Theorem 37 ( a-priori error estimate for surfaces), which splits the error into an approximation and a perturbation term. For the former we simply resort to Lemma 39 instead of Lemma 36 (approximability in ). For the latter we argue exactly as in Theorem 37 and thus employ (82) (uniform Poincaré-Friedrichs constant), Lemma 19 (perturbation error estimate for surfaces) and Corollary 32 (geometric consistency for surfaces). This shows the first asserted estimate. The second bound follows from the standard interpolation estimate
[TABLE]
and the condition . This ends the proof. ∎
4.4. A-Posteriori Error Analysis
In contrast to the previous section, we now derive error estimates in which rely on information extracted from the computed solution of (78) and data, but do not make use of the exact solution of (18). They are a-posteriori estimates of residual type, are fully computable, and are instrumental to drive adaptive procedures. In this vein, we mention [BCM*+*16, BCMN13] but we do not elaborate on this issue any longer.
The a-posteriori analysis requires a quasi-interpolation operator acting on functions, i.e. functions without point values. We use the Scott-Zhang operator and recall its local approximability and stability properties for all
[TABLE]
where is a macro patch defined in (65) associated with . We do not require that even if , as it happened earlier in the a-priori error analysis of Section 4.3.
In order to derive a posteriori error estimates, we first introduce the interior and jump residuals for any :
[TABLE]
where for is the face shared by and are pointing outward co-normals to the elements (see Section 2.6). We point that when using piecewise affine functions on polyhedral surfaces , the Laplace-Beltrami operator (13) vanishes within elements
[TABLE]
and that, in contrast to the flat case, in general. If denotes the jump residual on , then we define the element indicator to be
[TABLE]
and the error estimator to be
[TABLE]
Theorem 41** (a-posteriori upper bound for surfaces).**
Let be of class , be parametrized by and satisfy the geometric assumption (69). Let be the solution to (18) and be the solution to (78) with . Then, for we have
[TABLE]
Proof.
Using definitions (19) and (79), along with the consistency relation (34), enables us to write for any and
[TABLE]
with
[TABLE]
Employing the definition and changing variables we deduce .
On the one hand, decomposing over elements , and resorting to Corollary 13 (integration by parts) on , leads to
[TABLE]
and so
[TABLE]
because of the scaled trace inequality
[TABLE]
We now choose to be the Scott-Zhang quasi-interpolant of . The local approximability and stability properties (101) imply
[TABLE]
where we have used the finite ovelapping properties of the patches and Lemma 17 (norm equivalence). Regarding term we apply Corollary 32 (geometric consistency errors for surfaces) to arrive at
[TABLE]
because of the estimates
[TABLE]
which are a consequence of Lemma 17 (norm equivalence), , Lemma 2 (Poincaré-Friedrich inequality) and . Combining the above estimates, we end up with the assertion. ∎
To assess the tightness of the upper bound in Theorem 41 it is customary to show a lower bound. To this end, we introduce the so-called data oscillation
[TABLE]
where is the piecewise average of . This quantity accounts for the fact that the residual is evaluated in a weighted -norm rather than the natural -norm. This in turn makes the estimator computable but perhaps at the expense of overestimation. This is the subject of our next estimate, proved in [BCMN13]. We recall that for , denotes the union of elements in that intersect and stands for the lift of to via . Moreover, we set
[TABLE]
Theorem 42** (a-posteriori lower bound for surfaces).**
Under the same conditions of Theorem 41 (a-posteriori upper bound for surfaces), we have
[TABLE]
Proof.
The proof of the lower bound is standard and is only sketched here. It relies on an argument due to Verfürth [Ver13]. The starting point is the error relation (102) localized to via the test function , where is the cubic bubble taking value at the element barycenter. Employing the norm equivalence (44) (valid elementwise), we realize that
[TABLE]
whence taking in (102) yields
[TABLE]
upon recalling that with our choice of and the expression (103) for . Corollary 32 (geometric consistency errors for surfaces), combined with a triangle inequality, then leads to the desired estimate for the bulk term
[TABLE]
As for the jump term, we define for a side with adjacent elements , as the quadratic bubble taking value at the barycenter of and [math] at all other quadratic nodes in . We also let be the lift of to by the map . Taking and in (102), and recalling the expression (103) for and that , yields
[TABLE]
Finally, it suffices to use the preceding estimate for , together with
[TABLE]
to conclude the proof. ∎
One important observation to make is that is generically of higher order than for , whence this term can be ignored relative to asymptotically. However, the geometric estimator is linear and thus of the same order as , thereby making the lower bound of Theorem 42 questionable. This estimator comes from the estimate (89) of Corollary 32 (geometric consistency errors for surfaces), which cannot obviously be improved for surfaces of class . However, Corollary 33 (geometric consistency errors for surfaces) shows that this effect becomes of second order for surfaces of class . Practically, the estimator is pessimistic and leads to unnecessary and thus suboptimal refinements for surfaces [BD19]. We discuss the impact of this superconvergence estimate next following [BD19].
Theorem 43** (a-posteriori upper bound for surfaces).**
Let be of class and (67), (74), (90), and (91) hold. Let be the solution of (18) with and be the solution to (78) with , where corresponds to the parametrization of . Then
[TABLE]
Proof.
We proceed as in the proof of Theorem 41 (a-posteriori upper bound for surfaces) but using the distance function lift to represent the errors. We denote , for a generic and get for any
[TABLE]
with
[TABLE]
where we have used again (34) but with the error matrix now defined with respect to and given by (51) of Lemma 21 (geometric consistency). We tackle and exactly as in Theorem 41, thereby obtaining
[TABLE]
except that we resort to (94) of Corollary 33 (geometric consistency errors for surfaces) to estimate .
On the other hand, no longer vanishes because is defined via and the function via . Using to change variables back to we obtain
[TABLE]
whence becomes
[TABLE]
Invoking Proposition 34 (mismatch between and ) yields
[TABLE]
and concludes the proof because . ∎
We conclude with a lower bound for surfaces. We point out that, compared with the existing results in the literature, see e.g. [DD07], we account for the mismatch between the two lifts and .
Theorem 44** (a-posteriori lower bound for surfaces).**
Under the same conditions as Theorem 43 (a-posteriori upper bound for surfaces), we have
[TABLE]
where .
Proof.
The proof follows along the lines of Theorem 42 (a-posteriori lower bound for surfaces) with the following variants. We use Corollary 33 instead of Corollary 32 in the error representation (105) to tackle and account for the fact that via (106) for a generic lift . ∎
5. Trace Method
In this section we present a class of methods which are known as trace finite element methods or cut finite element methods [ORG09, BHL15, Reu15]. The setting for these methods is situations in which a PDE posed on an -dimensional hypersurface embedded in must be solved numerically, and a bulk or volume background mesh of some domain is present with . It is often more convenient to describe and solve associated PDE employing the background mesh instead of independently meshing . A paradigm physical example is a two-phase flow problem. There is subdivided into subdomains and (one for each phase) and is the interface between and . In simulations is typically meshed in order to solve equations of fluid dynamics (e.g., Stokes or Navier-Stokes), while accounting for interfacial effects such as surface tension also requires solving a surface PDE on . It can be particularly inconvenient to independently mesh and in dynamic simulations in which evolves as either a specified or free boundary. In addition to the overhead associated with transferring information between unrelated bulk and surface meshes, remeshing is generally necessary from time to time when parametric methods are used to describe dynamic interfaces because mesh degeneracies may occur as the surface deforms.
Trace and cut FEMs were introduced by Olshanskii et al [ORG09] and have been further developed over the past decade as one option for circumventing these difficulties. In order to describe them more precisely, first let be a simplicial decomposition of , . We let for any and set for the mesh-size of . We will omit to mention the explicit dependence on the shape regularity constant of
[TABLE]
in most estimates below. Assume that is a closed, -dimensional surface. As outlined in Section 2.3, is then the zero level set of a distance function defined on a tubular neighborhood of . Let consist of the continuous piecewise linear functions over . In order to fix thoughts, let be the Lagrange interpolant of satisfying
[TABLE]
The discrete computational surface is then defined by
[TABLE]
Below we also discuss how to derive from more general implicit representations of . Because is piecewise linear, consists of intersections of hyperplanes with simplices and is thus a polyhedron having triangular and quadrilateral faces for (see Figure 3). We denote by the collection of faces of . In addition, the conditions placed on ensure that so the perturbation results for surfaces outlined in Section 3.2 hold on with order geometric perturbation error.
The surface finite element space is simply the restriction of to :
[TABLE]
By its definition consists of the continuous functions which are affine over each face . We also denote by its subspace consisting of functions with vanishing mean values. In order to approximate the solution to the Laplace-Beltrami problem on , we first define a suitable approximation to and then seek such that
[TABLE]
This is the trace method and has two notable advantages:
- •
Only single mesh: The main advantage is that both bulk and interfacial effects can be computed using the same mesh.
- •
Error estimates: Optimal-order and regularity error estimates hold in the and norms.
On a practical and theoretical levels the method exhibits three main challenges:
- •
Implicit surface representation: The simplest option of taking the distance function to define and its Lagrange interpolant of to define is not generally practical as is rarely available in applications. It is generally more practical to assume that the discrete surface is derived from a more general level set representation of . We provide a brief discussion of general level set representations below.
- •
Surface integration: Computing the finite element system is more cumbersome than in standard parametric surface FEMs since both the mesh and the finite element space are derived from their corresponding bulk counterparts. These difficulties are manageable in the case of the piecewise linear method presented here, but become significantly more cumbersome when a higher-order surface approximation is used.
- •
Linear algebra and stabilization: In contrast to parametric surface FEMs there is no obvious practical basis for , only spanning sets derived from subsets of the bulk space . In practice such a spanning set is derived from the degrees of freedom for corresponding to elements touching . Degenerate modes arise from this procedure. These are either handled at the linear algebra level or by various stabilization procedures.
Theoretical study of trace FEMs is also more involved than for parametric surface FEMs. One prominent issue is that the surface mesh does not consist of shape regular elements, as is documented in Figure 3. This is because the faces in consist of arbitrary intersections of hyperplanes with simplices (planes and tetrahedra for ). Thus elements may be arbitrarily small with respect to the bulk mesh-size or fail to satisfy a minimum angle condition, and it is not possible to directly employ standard error estimation techniques. Properties of the “high-quality” bulk mesh and finite element space must be invoked instead, which in turn requires careful use of extensions and restrictions of functions to and from and . For purposes of intuition, it is however useful to note that the surface mesh does inherit some structure from the regularity of the bulk mesh . Elements in for example satisfy a maximum-angle condition [ORX12], and each element in also shares a vertex with a shape-regular element of diameter equivalent to [DO12].
Below we prove a priori and a posteriori error estimates for a piecewise linear trace FEM. In keeping with the previous section, we concentrate on surface representations and regularity in our discussion. In particular, we only assume that is , whereas previous approaches require that be . The recent article [OR17] provides a broader survey of trace FEMs, including discussion of topics such as higher-order versions, stabilization procedures, and space-time trace FEMs that we omit here.
5.1. Preliminaries
Bulk and Surface Meshes. Below we need to carefully distinguish between mesh structures defined relative to the surface mesh and those defined relative to the volume mesh . First note that we shall consistently denote by (-dimensional) surface elements lying in , which as we have noted above may not be shape-regular. In addition, will be used to denote -simplices lying in . Given a face , we denote by the simplex in which lies (or one of them if is a face shared by two bulk elements). In addition, given we denote by the patch of elements of surrounding (first ring)
[TABLE]
and by the patch of elements of surrounding (second ring). We also define
[TABLE]
whence the local mesh size of the face element is taken to be the diameter of the corresponding bulk element. Note that it is possible that We will also denote by the diameter of elements . We finally let
[TABLE]
be the set of elements of touching either or .
Geometric Assumptions. Above we described as the zero level set of an approximate distance function . In this section we first place abstract requirements on that are sufficient to obtain optimal-order and regularity a priori error estimates and then prove that these requirements are satisfied on sufficiently fine bulk meshes when is built from a suitably general level set description of . We now list three main geometric assumptions.
- •
Description of . We assume that is a polyhedral surface whose faces consist of the intersection of hyperplanes with simplices . We further assume that with the tubular neighborhood defined in (31).
- •
Geometric resolution of . Let be the distance function to , and be the outward unit normal on . We assume that
[TABLE]
This assumption is sufficient to ensure optimal decay of the geometric consistency error in a priori error estimates.
- •
Local flattening. We assume that for each with , there is a ball of radius with (independent of ) such that and there is a uniformly bi- map
[TABLE]
The flattening assumption (109) follows from the nature of the surface provided elements intersecting are sufficiently fine with respect to the inverse of the maximum principal curvature. The flattening map may be constructed by expressing as a graph over tangent hyperplanes of , with the radius of the domain of these graphs bounded by the inverse of the maximum principal curvature of (cf. [Eva98, Appendix C] for the construction of ; the bound for follows from the definition of curvature).
Level set representations. While we prove our results below under the abstract geometric resolution assumption (108) involving the distance function, in practice trace methods often build the discrete surface from a more general implicit representation of . Such a representation may be obtained by assuming that is the zero level set of a level-set function
[TABLE]
Broadening our assumptions concerning implicit representation of is important in many practical applications. Because the distance function has a closed form expression only if is a sphere or a torus, there are many settings where may easily be represented as a level set even if is not available. A simple example is the ellipsoid given by . Level set methods in which an evolving free boundary is computationally approximated by the level set of a discrete function are also popular in many applications. In this case it is also natural to define via a generic level set function rather than restrict attention to the distance function .
Our essential assumptions concerning are that and
[TABLE]
Because is a level set of , on , so the assumption (110) is equivalent to assuming that is nondegenerate on and points in the same direction as . Let be an approximation to satisfying
[TABLE]
and define the discrete surface by
[TABLE]
Lemma 45** (geometric resolution).**
Let be . Under the above assumptions, the inequality (108) holds for sufficiently small, namely
[TABLE]
Proof.
First let , for which the projection on is uniquely defined. Let \zeta(s):=\nabla\phi\big{(}s{\bf x}+(1-s){\bf P}_{d}({\bf x})\big{)}\cdot{\boldsymbol{\nu}}({\bf x}) and compute
[TABLE]
Since , , and , there thus exists a constant (depending on and ) such that
[TABLE]
according to (31). Therefore, for any we have and
[TABLE]
because . Given any face of , we realize that for all and
[TABLE]
If is sufficiently small, then and . This is the desired bound for the first term on the left hand side of (112).
To prove the remaining bound in (112), we note that for , we have and . Consequently, for such , we use (111), the bound already proved, and the nature of to obtain
[TABLE]
This completes the proof. ∎
Thus we have shown that it is possible to define the discrete surface using a generic level set representation of in such a way that has the same geometric approximation properties as if it were derived more directly from the distance function . Below we assume practical access to the distance function and associated geometric properties (curvatures and normal vectors) in two further places: the first one is the definition of the right hand side in formulating the trace FEM and the second one is the definition of geometric a posteriori error estimators. As outlined in [DD07], it is computationally feasible to accurately approximate , , and for under the assumption that we have access to a level set function with the properties assumed above. In outline, the foundational building block of this procedure is a numerical approximation to . Two such algorithms are proposed in [DD07], one being Newton’s method and the other an ad hoc first order method; cf. [Gra17] for generalizations and analysis of these methods. Once is computed, we then have
[TABLE]
These relationships allow for the computation of all geometric information required to bound geometric errors in the trace method a posteriori. In addition, because we may reasonably assume access to it is in turn reasonable to assume a consistent definition of the right hand side , that is, . A different definition of would lead to an additional consistency term in the results below.
Harmonic Extension and Traces. Here we collect instrumental results for our proofs of a priori and a posteriori error estimates. For the latter we use the fractional-order space , so we first define the seminorm of
[TABLE]
for a Lipschitz domain and , and corresponding norm
[TABLE]
Our first lemma is a standard extension result which may for example be found in [Gri85, Theorem 1.4.3.1].
Lemma 46** ( extension).**
Let be a bounded Lipschitz domain in , . Then there is an extension operator such that
[TABLE]
We also state a trace result relating and ; this is a special case of [Ada75, Theorem 7.58].
Lemma 47** (trace).**
If , , and is any -dimensional hyperplane in , then
[TABLE]
The following is an important technical lemma which expresses traces relationships between norms on surface elements (flat or curved) and corresponding norms on bulk elements. An essential component of these estimates is that they allow for surfaces to cut through bulk elements in an arbitrary fashion. Such estimates were essential in the proof of the first a posteriori estimates for trace methods in [DO12]. In the context of a priori error estimates for trace methods, these provide a substantially simplified proof of error bounds when compared with the original proofs given in [ORG09]; cf. [HH02, HH04, BHL15, Reu15].
Lemma 48** (trace estimates for cut elements).**
Let () be a (not necessarily bounded) Lipschitz domain, and let be the intersection of with an arbitrary hyperplane of dimension . Then
[TABLE]
where the hidden constant depends on the Lipschitz nature of but not on the orientation or size of . In particular, let with . Then
[TABLE]
In addition, given there hold
[TABLE]
and
[TABLE]
Proof.
The estimate is a special case of [Ada75, Lemma 5.19]. The scaled result (116) follows by a standard scaling argument.
To prove (117) and (118) we employ a flattening argument. First let be the unit reference simplex in with standard affine reference mapping satisfying and . Let now be the flattening map in assumption (109). It is possible to extend to all of so that the resulting extension is also , still flattens , and has derivative bounded above and below away from 0. To see this, take a smoothly weighted average of and the identity with weight 1 for on and weight 0 outside of . Having thus extended , we define . It is easy to check that and are uniformly bounded in and that lies in some -dimensional hyperplane .
For with satisfying , let now . We first prove (118) upon transforming to the reference element back and forth. We start with a simple scaling argument
[TABLE]
regardless of the actual size and orientation of relative to . Hence, applying a standard change of variables involving yields
[TABLE]
We next resort to the extension operator in Lemma 46 ( extension), the smoothness of , the fact that , the trace inequality (114), the smoothness of again, and the boundedness (113) of in , in this order, to arrive at
[TABLE]
The desired estimate (118) finally follows from a scaling argument from to employing again the map :
[TABLE]
To prove (117), we argue similarly to above except that we now employ and (115) instead of (114). Doing so yields
[TABLE]
Multiplying both sides by gives the desired bound (117). ∎
5.2. A Priori Error Estimates
We recall that we use the notation and that we omit to mention the explicit dependence on the shape regularity constant of in most estimates.
Geometric resolution and extensions. Given a surface of class and , Proposition 28 ( extension) yields the existence of an extension of to a tubular neighborhood with sufficiently small with respect to lying in and satisfying
[TABLE]
- •
First assumption on geometric resolution by the bulk mesh. We assume
[TABLE]
with sufficiently small so that (119) holds.
- •
Second assumption on geometric resolution by the bulk mesh. We assume that the layer satisfies
[TABLE]
This clearly holds for sufficiently small because the Hausdorff distance between and satisfies according to (108).
- •
Uniform Poincaré-Friedrichs estimate on . We assume that
[TABLE]
holds with uniform constant. According to the discussion below (82) (uniform Poincaré-Friedrichs constant), this only requires that and that on . These conditions are easily checkable and valid asymptotically.
Approximation properties of trace finite element space. We next state a fundamental approximation bound for the trace FEM, which we prove under the regularity assumption that is of class . We emphasize that this assumption is less restrictive than the hypotheses of previous approximation bounds for trace estimates, which assume that is of class .
Lemma 49** (trace approximation).**
Let be of class and the geometric resolution assumptions (108), (109), (120), and (121) hold. Then
[TABLE]
Proof.
Let be sufficiently small so that (120) is valid. Let be the standard Scott-Zhang interpolation operator on , and take with given by Proposition 28 ( extension) and satisfying (119). We then denote , add and subtract multiple terms, and apply the triangle inequality to find that
[TABLE]
where
[TABLE]
Here we have applied the interpolation operator componentwise to the -vector and used that . We next estimate each term separately.
In order to bound terms and , we employ Lemma 17 (norm equivalence) between and and recall that pointwise to find that
[TABLE]
We next apply the trace estimate (117), utilize standard approximation properties of , and finally use the bound (119) to obtain
[TABLE]
Here we have used that elementwise since is piecewise linear. Similar arguments lead to the following estimate for
[TABLE]
as well as provided . To show this estimate we let be the meanvalue of in and exploit the stability of in
[TABLE]
Moreover, applying the trace estimate (116) directly to the terms and yields
[TABLE]
and
[TABLE]
In order to bound term , we first note that
[TABLE]
An easy computation using the assumption (108) yields
[TABLE]
Thus employing the equivalence of norms on and , the trace estimate (117), the boundedness of , and the boundedness (119) of the extension yields
[TABLE]
We finally bound term . Given , we infer that
[TABLE]
and according to (108), whence
[TABLE]
In view of assumptions (121) and (120), and the bound , we deduce
[TABLE]
and conclude the proof. ∎
Theorem 50** (a-priori error estimates).**
Let be of class and let be so that the geometric assumptions (108), (109), (120), (121), and (122) are satisfied. Let and solve (19). If is the finite element solution of (107) with , then
[TABLE]
Proof.
With the geometric resolution estimate (108) and Lemma 49 (trace approximation) in hand, the proof is nearly identical to those of Theorem 37 ( a-priori error estimate) and Theorem 38 ( a-priori error estimate) for parametric surface FEM. We thus sketch the proof without details.
Step 1: error estimate. Let achieve the infimum in (123), , , and write the error representation formula as
[TABLE]
because . In view of Lemma 21 (geometric consistency) and the geometric resolution estimate (108) we deduce and
[TABLE]
On the other hand, Lemma 49 (trace approximation) yields
[TABLE]
The desired estimate follows from Lemma 3 (regularity).
Step 2: error estimate. Let denotes the inverse of restricted to . Let and ; likewise, let . We now solve dual problems on
[TABLE]
and on
[TABLE]
Note that the right-hand sides are compatible and Step 1 applies. We set and proceed as in Theorem 38 ( a-priori error estimate) to deduce the error representation
[TABLE]
because . Applying Lemma 3 (regularity) to yields . This together with Step 1 implies
[TABLE]
Making use again of Lemma 21 (geometric consistency) and the geometric resolution estimate (108) we deduce , whence
[TABLE]
Consequently,
[TABLE]
and the asserted bound follows from Lemma 17 (norm equivalence) and the auxiliary estimate
[TABLE]
The latter hinges on Corollary 33 (geometric consistency errors for surfaces) and the geometric resolution estimate (108), as in the proof of Theorem 38. This completes the proof. ∎
5.3. A Posteriori Error Estimates
A posteriori error estimates for the trace FEM were first proved in [DO12], while a posteriori estimates for a trace FEM based on octree meshes were proved in [CO15]. The proof of the estimates given in [DO12] is significantly different than that of the a priori estimates given above. A main reason for the difference is that, in contrast to the framework above that deals with quasi-uniform meshes, we assume that the bulk mesh is merely shape-regular. This is necessary to allow for meaningful mesh grading in adaptive algorithms. Moreover, the extension used in Proposition 28 ( extension) is not immediately useful here because the parameter specifying the width of the tubular neighborhood about is taken to be proportional to when is quasi-uniform; such a global mesh size parameter is no longer meaningful on graded meshes. A local counterpart of Proposition 28 on graded meshes, that uses the normal extension instead of the regularized normal extension, is employed in [CO15] to prove a posteriori bounds, but with the drawback that the constants in the estimates depend on the difference in refinement depth between the largest and smallest elements in the bulk mesh. We thus present here the framework of [DO12], which relies on the harmonic extension of into instead of either the normal extension or the extension of Proposition 28.
Notation and surface resolution assumptions. We make the following two assumptions concerning resolution of by the bulk mesh :
- •
Resolution of skin layer between and . Given a discrete surface element , let
[TABLE]
The set is the collection of all points lying on line segments connecting points in and their images . We assume that
[TABLE]
that is, lies in the volume element patch (first ring) corresponding to the face element , which is defined in section 5.1.
- •
Normal projections of elements have finite overlap. We assume that
[TABLE]
where the second ring is also defined in section 5.1.
The above assumptions hold if is sufficiently resolved by the bulk mesh . To see this, note first that by (108), so that for all . On the other hand, . Thus there is a constant such that the assumption (124) is satisfied when ; here depends on geometric properties of , the shape regularity constant of and properties of the Lagrange interpolant. In principle an upper bound for could be computed and this condition checked, but this has not been attempted in the literature and we do not do so here. A similar but more involved argument holds for the assumption (125).
Extension for a posteriori error estimates. The next essential result states that a given a function can be boundedly extended to .
Lemma 51** (harmonic extension).**
Let be a closed surface of class and dimension embedded in for . Given , there is such that and
[TABLE]
Proof.
First let solve on the bulk domain comprising the interior of , with on . By [JK95, Theorem 5.15], we have that , , and . Boundedly extending to via the extension operator defined in Lemma 46 ( extension) completes the proof. ∎
Preliminary results. We now give a technical lemma that quantifies the evaluation mismatch between and for a discrete function.
Lemma 52** (evaluation mismatch between and ).**
Let , and let the conditions (108), (109), and (124) hold. For all , we have
[TABLE]
Proof.
Fix , and let , . Then and . Since , we see that
[TABLE]
whence and
[TABLE]
The assertion follows from assumptions (108) and (124). ∎
A posteriori upper bound. First we define a residual error indicator
[TABLE]
and corresponding estimator
[TABLE]
Here denotes the jump in the normal component of the argument over . Because we have assumed access to the closest point projection , we also employ a geometric indicator that directly accesses information from
[TABLE]
and corresponding geometric estimator
[TABLE]
Theorem 53** (a-posteriori upper estimate).**
Let be of class and let be defined so that the geometric assumptions (108), (109), (124), and (125) hold. Let and solve (19). If is the finite element solution of (107) with , and where is the inverse of restricted to , then
[TABLE]
Proof.
We proceed in several steps.
Step 1: Error representation via the residual equation. First we note that
[TABLE]
and then write as in (102) that
[TABLE]
with
[TABLE]
Here is as in (51), , and is a suitable approximation of the extension of given by Lemma 51 (harmonic extension). Note that because of the definition .
Step 2: Bounding the geometric error terms. Using (56) (or more accurately the corresponding pointwise bound from which it is derived) directly yields
[TABLE]
Thus making use of Lemma 17 (norm equivalence) implies
[TABLE]
Step 3: Bounding the residual term. In order to bound , we first decompose the integrals over faces and then integrate by parts to arrive at
[TABLE]
We may thus complete the proof upon showing that
[TABLE]
Given , we begin by considering the quantity for any edge . We first use the triangle inequality to obtain
[TABLE]
with , and examine the last term first. Since is an -dimensional edge with diam, combining Hölder inequality and Lemma 52 (evaluation mismatch between and ) with an inverse estimate over the -dimensional patch yields
[TABLE]
For the first term we argue as follows. Let be the dimensional hyperplane containing . While it may be that , the shape regularity of implies that
[TABLE]
Thus there exists an dimensional ball so that and . This ball is the candidate for applying the -scaled version of (115) of Lemma 48 (trace estimates for cut elements), namely
[TABLE]
Since , we change variables from to while employing Lemma 17 (norm equivalence) to get
[TABLE]
We observe that in light of (125), whence
[TABLE]
We now carry out a similar but more direct computation for the term appearing in . Again using Lemma 52 we obtain
[TABLE]
Combining the previous estimates we end up with
[TABLE]
Summing over while using finite overlap of the patches yields
[TABLE]
Step 4: Interpolation. We next apply (118) to the function while realizing that . Doing so yields and
[TABLE]
Next let , where is the Scott-Zhang interpolation operator on the bulk space . Standard approximation theory in then yields
[TABLE]
and
[TABLE]
for every . Using the finite overlap of the patches and the bound of Lemma 51 (harmonic extension), we finally obtain
[TABLE]
This completes the proof. ∎
Remark 54** (efficiency).**
In a posteriori error analysis it is standard to prove lower (efficiency) bounds such as those in Theorems 42 and 44. For trace methods such estimates would ideally take the form
[TABLE]
where is the patch of elements about and is a heuristically higher-order term measuring the deviation of from the piecewise constants. However, the standard proof of this result does not work for trace methods due to the irregular structure of the surface mesh . The paper [DO12] contains partial efficiency results for the volume residual but none for the jump residual term. Numerical experiments suggest that a local efficiency result may hold, but also show a slight degeneration of the constant as the mesh is refined. Thus it is not clear whether the estimators we have studied for the trace method are efficient, and if so what form an efficiency estimate would take.
6. Narrow Band Method
In the narrow band approach, the partial differential equation (19) on
[TABLE]
is extended to the tubular neighborhood of defined in (29)
[TABLE]
we refer to the original papers [BCOS01, Bur09]. The finite element method is then posed over a discrete approximation to . We assume that is of class and so that (61) holds, namely , and all the properties of the distance function detailed in Section 2 are valid in .
A natural / standard way to extend and to is to use the constant extensions along the normal direction
[TABLE]
We use the latter to design the FEM. However, we need to derive optimal a-priori error estimates for the FEM, which entails when using the closest point projection . We circumvent this extra regularity on via Proposition 28 ( extension), which defines as a normal extension relative to a perturbation of constructed as a zero level set of a regularized distance function . We will show below in Lemma 57 (narrow band PDE consistency) that such a function satisfies
[TABLE]
The specific choice of adds several technicalities to the proof of (129) but reduces the regularity of to . This seems to be a new result in the literature consistent with the underlying regularity . This also motivates the narrow band FEM as a straightforward (bulk) finite element approximation of (129) upon replacing by a polygonal approximation dictated by , the Lagrange interpolant of in the bulk. We discuss this next. We refer to [OS16] for higher order FEMs and [DDEH10, DER14] for an algorithm based on a level-set function, rather that the less practical distance function. The essential ideas, however, are similar to those below but are more technical.
6.1. The Narrow Band FEM
We assume that is enclosed in a dimensional polyhedral domain and denote by a partition of made of simplices. We omit to mention the explicit dependence on the shape regularity constant of
[TABLE]
in most estimates below; we use the notation and . Let stand for the Lagrange interpolant of the distance function by continuous piecewise linear functions over . The discrete distance function induces the discrete narrow band
[TABLE]
Notice that standard interpolation estimates imply
[TABLE]
where is a constant only depending on . This implies the non-degeneracy property
[TABLE]
provided is sufficiently small so that Combining estimates (130) and (131) we deduce that the Hausdorff distance between and satisfies
[TABLE]
Moreover, to guarantee that , we observe
[TABLE]
In view of (31), it thus suffices to restrict and so that
[TABLE]
Hereafter we make the structural assumption
[TABLE]
with so that (133) holds for sufficiently small.
We denote by the restriction of to in the sense that
[TABLE]
The finite element space associated with is then constructed in the usual way
[TABLE]
where we recall that stands for the space of polynomials of degree 1. The subspace of functions with vanishing mean value is denoted .
With this notation at hand and inspired by (129), we define the narrow band finite element solution to satisfy
[TABLE]
where is an approximation to satisfying . In order to make a convenient choice of , we first define by
[TABLE]
the properties of are explored thoroughly later in this section. With this definition in hand, we let
[TABLE]
This requires having access to and , which we assume hereafter. Since has vanishing meanvalue, (135) is also valid for all . The existence and uniqueness of follows directly from the Lax-Milgram lemma.
6.2. PDE Geometric Consistency
We intend to prove (129) for the extension in Proposition 28 ( extension) of . We recall Proposition 30 (PDE satisfied by )
[TABLE]
multiply by a test function and integrate by parts in to obtain
[TABLE]
Notice that we have used that is the outward pointing normal to . We start by estimating geometric quantities appearing in (137).
Lemma 55** (properties of and ).**
Let be of class and be sufficiently small. Then for all we have
[TABLE]
and
[TABLE]
Proof.
We recall the definitions of from Proposition 30 (PDE satisfied by ) and from Lemma 29 (PDE satisfies by )
[TABLE]
where is the projection from onto and is its inverse when restricted to . Note that in
[TABLE]
We thus need to examine the eigenvalues of
[TABLE]
with corresponding to the eigenvector . We infer that
[TABLE]
where
[TABLE]
according to Lemma 26 (properties of ) and (61) with . Hence
[TABLE]
for all . This takes care of the second term in the equation for . It remains to estimate . Since reads as follows on
[TABLE]
combining the previous estimate with Lemma 26 (properties of ) yields
[TABLE]
This implies for suficiently small and thus leads to (138).
We now prove (139) which, in light of (138), reduces to the estimate . We recall from Proposition 30 that in
[TABLE]
Since for and thanks to Lemma 26 (properties of ), the Taylor expansion of centered at and computed at converges for sufficiently small. It reads
[TABLE]
for some . The definition of given in Lemma 29 yields
[TABLE]
where satisfies . Moreover,
[TABLE]
whence for all we see that
[TABLE]
Since
[TABLE]
thanks to Lemma 26 (properties of ), we get
[TABLE]
as asserted. This concludes the proof. ∎
Remark 56** (estimate of ).**
Lemma 22 (relation between and ) gives the expression for the change of infinitesimal area between and . Proceeding as in the proof of the above lemma, we get
[TABLE]
provided is sufficiently small so that .
We are now in position to prove a consistency estimate measuring the discrepancy between and in .
Lemma 57** (narrow band PDE consistency).**
Let be of class and be the extension of Proposition 28 ( extension) with sufficiently small. If , then for all , we have
[TABLE]
Proof.
In view of (137), we deduce
[TABLE]
where
[TABLE]
with . We now examine these three terms separately.
Step 1: Term . Since is constant along the direction , we realize that and Lemma 55 (properties of and ) directly yields
[TABLE]
Step 2: Term . Let and consider the isomorphisms
[TABLE]
where is the inverse of on and is the inverse of on . Using the coarea formula (63) together with we write
[TABLE]
and combining with Lemma 22 (relation between and ), we obtain
[TABLE]
where
[TABLE]
We proceed to estimate each term separately. To manipulate we first observe that changing variables from to , to , and to and invoking Lemma 22 (relation between and ) yields
[TABLE]
where
[TABLE]
Therefore, denoting by the infinitesimal change in area induced by on
[TABLE]
we infer again from the coarea formula (63) that
[TABLE]
where is defined on each by . Notice that the map is a bi-Lipschitz perturbation of the identity with perturbation constant
[TABLE]
because
[TABLE]
Moreover, since , (138) and (140) imply
[TABLE]
These estimates in conjunction in Proposition 35 (Lipschitz perturbation) give
[TABLE]
we observe that to apply Proposition 35 we take , which are Lipschitz domains, and extend to so that .
Upon utilizing the coarea formula (63) once more, we obtain for
[TABLE]
so that (140) yields
[TABLE]
We proceed similarly for but using in addition that
[TABLE]
and
[TABLE]
thanks to (138) and (140) again. We thus obtain for an estimate similar to those for and , whence
[TABLE]
Step 3: Term . In view of , we first note that
[TABLE]
Invoking Lemma 55 (properties of and ) and then Lemma 26 (properties of ) yields
[TABLE]
It remains to use trace inequalities to obtain
[TABLE]
Step 4: Normal extension. Gathering the above estimates we find that
[TABLE]
We finally deduce because is the normal extension of to , and
[TABLE]
upon combining Proposition 28 ( extension) with Lemma 3 (regularity). This leads to the desired estimate. ∎
6.3. Properties of the Narrow Band FEM
To begin with, we recall the definition of , that accounts for the mismatch between and :
[TABLE]
Note that if then , because this is what happens with all points in the line within . Since ,
[TABLE]
implies that and the map is well defined. Further properties of are discussed next. Before doing so, we mention that the results provided below are not optimal (to avoid technicalities) but are sufficient for our analysis. We refer to [DER14, OS16] for higher order estimates.
Lemma 58** (properties of ).**
Let be of class and be sufficiently small. Then, the map is bi-Lipschitz with
[TABLE]
for some constant independent of and . Moreover, there holds
[TABLE]
and
[TABLE]
Proof.
From the definition (143) of and the interpolation estimate (130), we find that
[TABLE]
Furthermore, we compute
[TABLE]
to deduce
[TABLE]
The above two estimates yield (145) because for sufficiently small. Exploiting (145), we also deduce that is invertible, bi-Lipschitz and that (144) holds for sufficiently small.
We are left to show (146). This follows from for any invertible matrix and the first order Taylor expansion of
[TABLE]
about and evaluated at , along with (145) and the fact that . This concludes the proof. ∎
The previous lemma is instrumental to estimate the consistency error
[TABLE]
due to the approximation of the narrow band by and to the use of in the discrete formulation (135). Since is of class , we assume without loss of generality that the function constructed in Proposition 28 ( extension) extends to and satisfies . In light of , the consistency error (147) is well defined.
Lemma 59** (narrow band geometric consistency).**
Let be of class and and satisfy the structural condition (134) and be sufficiently small. Let , solve (18), and be the extension of given by (62) with . Let also be given by (136). Then the consistency error (147) satisfies for all
[TABLE]
Proof.
We compare the consistency errors (147) and (141) term by term.
Step 1: Dirichlet integrals. Utilizing the change of variables induced by the map we end up with
[TABLE]
where
[TABLE]
In view of Proposition 35 (Lipschitz perturbation) and Lemma 58 (properties of ), we infer that
[TABLE]
Similarly for , we observe that
[TABLE]
so that employing Lemma 58 (properties of ) yields
[TABLE]
Recalling the structural assumption , Lemma 3 (regularity) as well as , the estimates for , and guarantee
[TABLE]
Step 2: Forcing. Recalling (136), we rewrite the forcing term in (147) as
[TABLE]
where
[TABLE]
We make use of (144) and (146), along with a change of variables, to compute
[TABLE]
Since , the first equivalence resulting from (144) and the second from the coarea formula, using (146) again we obtain
[TABLE]
To estimate the rightmost term we exploit the fact that has a vanishing mean on . Using the coarea formula (63), we see that
[TABLE]
where \mu_{s}=\det\big{(}{\bf I}-dD^{2}d\big{)}^{-1}\circ{\mathbf{Q}_{s}} according to Lemma 22 (relation between and ). Remark 56 (estimate of ) in turn leads to
[TABLE]
Consequently, collecting the previous estimates and using the structural assumption again readily gives
[TABLE]
Gathering the bounds for for , we discover
[TABLE]
Step 3: Conclusion. The assertion follows from the bounds derived in Steps 1 and 2 together with the estimate (141) of Lemma 57 (narrow band PDE consistency) with . The proof is complete. ∎
6.4. A Priori Error Estimates
All of the ingredients for a-priori error analysis in the narrow band norm are now in place. We recall that the extension constructed in Proposition 28 ( extension) is further extended to and satisfies
[TABLE]
Theorem 60** (a-priori error estimate).**
Let be of class and and satisfy the structural condition (134) and be sufficiently small. Let be defined by (18) with and be its extension given by (62) with . Let be the finite element solution to (135) with given in (136). Then, the following error estimate is valid
[TABLE]
with hidden constant independent of and .
Proof.
The proof consists of a Strang type argument. For any the equation (135) satisfied by and the definition (147) of give
[TABLE]
Invoking Lemma 59 (narrow band geometric consistency), together with the structural assumption (134), yields
[TABLE]
The desired error estimate follows from a triangle inequality. ∎
Corollary 61** (rate of convergence in ).**
Under the assumptions of Theorem 60 we have
[TABLE]
Proof.
In view of (148) standard polynomial interpolation theory gives
[TABLE]
where is the Scott-Zhang interpolant of . It remains to use Proposition 28 ( extension) and Lemma 3 (regularity) to arrive at
[TABLE]
The asserted estimate follows from Theorem 60 (a-priori estimate). ∎
In addition, we follow [OS16] to deduce a rate of convergence for .
Corollary 62** (rate of convergence on ).**
Under the assumptions of Theorem 60 we have
[TABLE]
Proof.
We recall the scaled trace inequality (117): for a bulk triangulation there exists a constant only depending on the mesh shape regularity constant of such that for and , one has
[TABLE]
where . We apply this inequality with , and sufficiently small, to obtain
[TABLE]
Summing up over all with non-empty intersection with , Proposition 28 ( extension) and Corollary 61 (rate of convergence in ) give
[TABLE]
The desired estimate follows from Lemma 3 (regularity). ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Ada 75] Robert A. Adams. Sobolev spaces . Academic Press [A subsidiary of Harcourt Brace Jovanovich, Publishers], New York-London, 1975. Pure and Applied Mathematics, Vol. 65.
- 2[ADM + 15] Paola F. Antonietti, Andreas Dedner, Pravin Madhavan, Simone Stangalino, Björn Stinner, and Marco Verani. High order discontinuous Galerkin methods for elliptic problems on surfaces. SIAM J. Numer. Anal. , 53(2):1145–1171, 2015.
- 3[Aub 82] Thierry Aubin. Nonlinear analysis on manifolds. Monge-Ampère equations , volume 252 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] . Springer-Verlag, New York, 1982.
- 4[BCM + 16] Andrea Bonito, J. Manuel Cascón, Khamron Mekchay, Pedro Morin, and Ricardo H. Nochetto. High-order AFEM for the Laplace-Beltrami operator: Convergence rates. Found. Comput. Math. , 16(6):1473–1539, 2016.
- 5[BCMN 13] A. Bonito, J. M. Cascón, P. Morin, and R. H. Nochetto. AFEM for geometric PDE: the Laplace-Beltrami operator. In Analysis and Numerics of Partial Differential Equations , volume 4 of Springer I Nd AM Ser. , pages 257–306. Springer, Milan, 2013.
- 6[BCOS 01] Marcelo Bertalmío, Li-Tien Cheng, Stanley Osher, and Guillermo Sapiro. Variational problems and partial differential equations on implicit surfaces. J. Comput. Phys. , 174(2):759–780, 2001.
- 7[BD 19] A. Bonito and A. Demlow. A posteriori error estimates for the laplace-beltrami operator on parametric C 2 superscript 𝐶 2 {C}^{2} surfaces. SIAM J. Numer. Anal. , 57(3):973–996, 2019.
- 8[BDO] A. Bonito, A. Demlow, and J. Owen. Convergence and optimality for higher order afem for eigenvalue clusters of the Laplace-Beltrami operator. in preparation.
