Abstract
We develop a finite element method for the Laplace–Beltrami operator on a surface with boundary and nonhomogeneous Dirichlet boundary conditions. The method is based on a triangulation of the surface and the boundary conditions are enforced weakly using Nitsche’s method. We prove optimal order a priori error estimates for piecewise continuous polynomials of order in the energy and norms that take the approximation of the surface and the boundary into account.
Mathematics Subject Classification: 65M60, 65M85
Introduction
Finite element methods for problems on surfaces have been rapidly developed starting with the seminal work of Dziuk [11]. Different approaches have been developed including methods based on meshed surfaces [1, 9, 10, 15, 17], and methods based on implicit or embedded approaches [5, 20, 21], see also the overview articles [3, 12], and the references therein. So far the theoretical developments are, however, restricted to surfaces without boundary.
In this contribution we develop a finite element method for the Laplace–Beltrami operator on a surface which has a boundary equipped with a nonhomogeneous Dirichlet boundary condition. The results may be readily extended to include Neumann conditions on part of the boundary, which we also comment on in a remark. The method is based on a triangulation of the surface together with a Nitsche formulation [19] for the Dirichlet boundary condition. Polynomials of order k are used both in the interpolation of the surface and in the finite element space. Our theoretical approach is related to the recent work [4] where a priori error estimates for a Nitsche method with so called boundary value correction [2] is developed for the Dirichlet problem on a (flat) domain in . Boundary value correction consists of using a modified bilinear form that compensates for the approximation of the boundary in such a way that higher order convergence may be obtained using for instance only piecewise linear approximation of the boundary. We also mention the work [23] where the smooth curved boundary of a domain in is interpolated and Dirichlet boundary conditions are strongly enforced in the nodes.
Provided the error in the position of the approximate surface and its boundary is (pointwise) of order and the error in the normals/tangents is of order k, we prove optimal order error estimates in the and energy norms. No additional regularity of the exact solution, compared to standard estimates, is required. The proof is based on a Strang Lemma which accounts for the error caused by approximation of the solution, the surface, and the boundary. Here the discrete surface is mapped using a closest point mapping onto a surface containing the exact surface. The error caused by the boundary approximation is then handled using a consistency argument. Special care is required to obtain optimal order error estimates and a refined Aubin–Nitsche duality argument is used which exploits the fact that the solution to dual problem is small close to the boundary since the dual problem is equipped with a homogeneous Dirichlet condition. Even though our main focus in this contribution is the weak Nitsche method to handle the Dirichlet condition a standard strong implementation is also of interest and we therefore include a detailed description how strong boundary conditions may be implemented and analysed in our framework.
The outline of the paper is as follows: In Sect. 2 we formulate the model problem and finite element method. We also formulate the precise assumptions on the approximation of the surface and its boundary. In Sect. 3 we develop the necessary results to prove our main error estimates. In Sect. 4 we present numerical results confirming our theoretical findings.
Model problem and method
The surface
Let, be a surface with smooth boundary , where is a smooth closed connected hypersurface embedded in . We let n be the exterior unit normal to and be the exterior unit conormal to , i.e. is orthogonal both to the tangent vector of at x and the normal n(x) of . For , we denote its associated signed distance function by which satisfies , and we define an open tubular neighborhood of by with . Then there is such that the closest point mapping assigns precisely one point on to each point in . The closest point mapping takes the form
| 2.1 |
For the boundary curve , let be the distance function to the curve , and be the associated closest point mapping with associated tubular neighborhood . Note that there is such that the closest point mapping is well defined. Finally, we let and introduce .
Remark 2.1
Clearly we may take to be a surface that is only slightly larger than but for simplicity we have taken closed in order to obtain a well defined closest point mapping without boundary effects in a convenient way.
The problem
Tangential calculus For each let and be the tangent and normal spaces equipped with the inner products and . Let be the projection of onto the tangent space given by and let be the orthogonal projection onto the normal space given by . The tangent gradient is defined by . For a tangential vector field w, i.e. a mapping , the divergence is defined by . Then the Laplace–Beltrami operator is given by . Note that we have Green’s formula
| 2.2 |
where denotes the usual inner product on .
Model problem Find such that
| 2.3 |
| 2.4 |
where and are given data. Thanks to the Lax–Milgram theorem, there is a unique solution to this problem. Moreover, we have the elliptic regularity estimate
| 2.5 |
since and are smooth. Here and below we use the notation to denote less or equal up to a constant. We also adopt the standard notation for the Sobolev space of order s on with norm . For we use the notation with norm , see [24] for a detailed description of Sobolev spaces on smooth manifolds with boundary.
The discrete surface and finite element spaces
To formulate our finite element method for the boundary value problem (2.3)–(2.4) in the next section, we here summarize our assumptions on the approximation properties of the discretization of .
Discrete surface Let be a family of connected triangular surfaces with, mesh parameter h, that approximates and let be the mesh associated with . For each element , there is a bijection such that , where is a reference triangle in and is the space of polynomials of order less or equal to k. We assume that the mesh is quasi-uniform. For each , we let be the unit normal to , oriented such that . On the element edges forming , we define to be the exterior unit conormal to , i.e. is orthogonal both to the tangent vector of at x and the normal of . We also introduce the tangent projection and the normal projection , associated with .
Geometric approximation property We assume that approximate in the following way: for all it holds
| 2.6 |
| 2.7 |
| 2.8 |
| 2.9 |
| 2.10 |
| 2.11 |
Note that it follows that we also have the estimate
| 2.12 |
for the unit tangent vectors and of and .
Finite element spaces Let be the space of parametric continuous piecewise polynomials of order k defined on , i.e.
| 2.13 |
where is the space of polynomials of order less or equal to k defined on the reference triangle defined above. We study the approximation properties of in Sect. 3.4, where we define an interpolation operator and present associated interpolation error estimates.
The finite element method
The finite element method for the boundary value problem (2.3)–(2.4) takes the form: find such that
| 2.14 |
where
| 2.15 |
| 2.16 |
Here is a parameter, and f is extended from to in such a way that and
| 2.17 |
where for and for .
Remark 2.2
Note that in order to prove optimal a priori error estimates for piecewise polynomials of order k we require and thus . For we have and for we require . Thus we conclude that (2.17) does not require any additional regularity compared to the standard situation. We will also see in Sect. 3.4 below that there indeed exists extensions of functions that preserve regularity.
A priori error estimates
We derive a priori error estimates that take both the approximation of the geometry and the solution into account. The main new feature is that our analysis also takes the approximation of the boundary into account.
Lifting and extension of functions
We collect some basic facts about lifting and extensions of functions, their derivatives, and related change of variable formulas, see for instance [5, 10, 11], for further details.
- For each function v defined on we define the extension
to . For each function v defined on we define the lift to by3.1
Here and below we use the notation for any subset .3.2 - The derivative of the closest point mapping is given by
where and are the tangent spaces to at and to at , respectively. Furthermore, is the tangential curvature tensor which satisfies the estimate , for some small enough , see [14] for further details. We use B to denote a matrix representation of the operator dp with respect to an arbitrary choice of orthonormal bases in and . We also note that B is invertible.3.3 - Gradients of extensions and lifts are given by
where the gradients are represented as column vectors and the transpose is defined by , for all and .3.4 - We have the following estimates
3.5 - We have the change of variables formulas
for a subset , and3.6
for a subset . Here |B| denotes the absolute value of the determinant of B (recall that we are using orthonormal bases in the tangent spaces) and denotes the norm of the restriction of B to the one dimensional tangent space of the boundary curve. We then have the estimates3.7
and3.8
Estimate (3.8) appear in several papers, see for instance [10]. Estimate (3.9) is less common but appears in papers on discontinuous Galerkin methods on surfaces, see [6, 9, 17]. For completeness we include a simple proof of (3.9). Verification of (3.9) Let be a parametrization of the curve in , with a some positive real number. Then , , is a parametrization of . We have3.9
and since also3.10 3.11
Here we estimated by first using the identity3.12 3.13 3.14 3.15
and then using the estimate , for , to conclude that3.16 3.17
Norms
We define the norms
| 3.20 |
| 3.21 |
Then the following equivalences hold
| 3.22 |
| 3.23 |
Remark 3.1
We will see that it is convenient to have access to the norms and , involving the boundary terms since that allows us to take advantage of stronger control of the solution to the dual problem in the vicinity of the boundary, which is used in the proof.
Verification of (3.22) In view of (3.19) it is enough to verify the equivalence , between the boundary norms. First we have using a change of domain of integration from to and the bound (3.9),
| 3.24 |
Next again changing domain of integration from to , using the identity for the gradient (3.4), the uniform boundedness of , and (3.9) we obtain
| 3.25 |
| 3.26 |
Coercivity and continuity
Using standard techniques, see [19] or Chapter 14.2 in [16], we find that is coercive
| 3.27 |
provided is large enough. Furthermore, it follows directly from the Cauchy–Schwarz inequality that is continuous
| 3.28 |
where . We also note that for , and thus for fixed , existence and uniqueness of the solution to the finite element problem (2.14) follows from the Lax–Milgram lemma.
Extension and interpolation
Extension We note that there is an extension operator such that
| 3.29 |
This result follows by mapping to a reference neighborhood in using a smooth local chart and then applying the extension theorem, see [13], and finally mapping back to the surface. For brevity we shall use the notation v for the extended function as well, i.e., on . We can then extend v to by using the closest point extension, we use the notation .
Interpolation We may now define the interpolation operator
| 3.30 |
where is a Scott–Zhang interpolation operator, see [22] and in particular the extension to triangulated surfaces in [8], without special treatment of the boundary condition. More precisely each node is associated with a triangle such that . Let be the Lagrange basis on and let be the dual basis such that , and let be the dual basis function associated with node i. Then the nodal values are defined by
| 3.31 |
Remark 3.2
We need no particular adjustment of the interpolant at the boundary since we are using weak enforcement of the boundary conditions. In Remark 3.9 we consider strong boundary conditions and also use a Scott–Zhang interpolation operator which interpolates the boundary data at the boundary.
Then the following interpolation error estimate holds
| 3.32 |
where is the patch of elements which are node neighbors to K lifted onto . See Theorem 3.2 in [8] for a proof.
Using the trace inequality
| 3.33 |
where is the diameter of element K, to estimate the boundary contribution in , followed by the interpolation estimate (3.32) and the stability of the extension operator (3.29), we conclude that
| 3.34 |
We will use the short hand notation for the lift of the interpolant. We refer to [10, 18] for further details on interpolation on triangulated surfaces.
Strang Lemma
In order to formulate a Strang Lemma we first define auxiliary forms on corresponding to the discrete form on as follows
| 3.35 |
| 3.36 |
Here the mapping is defined by the identity
| 3.37 |
Then we find that is a bijection since and are bijections. Note that , , and are only used in the analysis and do not have to be implemented.
Lemma 3.1
With u the solution of (2.3–2.4) and the solution of (2.14) the following estimate holds
| 3.38 |
Remark 3.3
In (3.38) the first term on the right hand side is an interpolation error, the second and third terms account for the approximation of the surface by and can be considered as quadrature or geometric errors, finally the fourth term is a consistency error term which accounts for the approximation of the boundary of the surface.
Proof
We have
| 3.39 |
Using equivalence of norms (3.22) and coercivity of the bilinear form we have
| 3.40 |
Next we have the identity
| 3.41 |
| 3.42 |
| 3.43 |
where in (3.41) we used the equation (2.14) to eliminate , in (3.42) we added and subtracted and , in (3.43) we added and subtracted , and rearranged the terms. Combining (3.40) and (3.43) directly yields the Strang estimate (3.38).
Estimate of the consistency error
In this section we derive an estimate for the consistency error, i.e., the fourth term on the right hand side in the Strang Lemma 3.1. First we derive an identity for the consistency error in Lemma 3.2 and then we prove two technical results in Lemma 3.3 and Lemma 3.4, and finally we give a bound of the consistency error in Lemma 3.5. In order to keep track of the error emanating from the boundary approximation we introduce the notation
| 3.44 |
where
| 3.45 |
and we recall that is defined in (3.37). The estimate in (3.44) follows from the triangle inequality and the geometry approximation properties (2.8) and (2.10).
Lemma 3.2
Let u be the solution to (2.3–2.4), then the following identity holds
| 3.46 |
for all .
Proof
For we have using Green’s formula
| 3.47 |
| 3.48 |
| 3.49 |
where we used the fact that on and the definition (3.35) of . Next using the boundary condition on we conclude that
| 3.50 |
Rearranging the terms we obtain
| 3.51 |
where the term on the left hand side is and the proof is complete.
Lemma 3.3
The following estimate holds
| 3.52 |
where .
Proof
For each let be the line segment between x and , the unit tangent vector to , and let , , be a parametrization of . Then we have the following estimate
| 3.53 |
| 3.54 |
| 3.55 |
| 3.56 |
where we used the following estimates: (3.54) the Cauchy–Schwarz inequality, (3.55) the chain rule to conclude that , and thus we have the estimate
| 3.57 |
since dp is uniformly bounded in , (3.56) changed the domain of integration from to . Integrating over gives
| 3.58 |
| 3.59 |
| 3.60 |
| 3.61 |
where we used the following estimates: (3.59) we used Hölder’s inequality, (3.60) we used the fact that and changed domain of integration from to , and (3.61) we integrated over a larger tubular neighborhood of of thickness . We thus conclude that we have the estimate
| 3.62 |
In order to proceed with the estimates we introduce, for each , with small enough, the surface
| 3.63 |
and its boundary . Starting from (3.62) and using Hölder’s inequality in the normal direction we obtain
| 3.64 |
| 3.65 |
Here we estimated using a trace inequality
| 3.66 |
| 3.67 |
| 3.68 |
where we used the stability (3.29) of the extension of v from to . To see that the constant is uniformly bounded for , we may construct a diffeomorphism that also maps onto , which has uniformly bounded derivatives for , see the construction in [7]. For we then have
| 3.69 |
where we used the uniform boundedness of first order derivatives of in the first and third inequality and applied a standard trace inequality on the fixed domain in the second inequality.
Lemma 3.4
The following estimates hold
| 3.70 |
| 3.71 |
for and .
Proof
Using the same notation as in Lemma 3.3 and proceeding in the same way as in (3.53)–(3.56) we obtain, for each ,
| 3.72 |
| 3.73 |
| 3.74 |
Integrating along we obtain
| 3.75 |
| 3.76 |
Finally, let , be the part of that resides outside of , then we have , and using the estimate (3.76) together with suitable changes of variables of integration we obtain
| 3.77 |
| 3.78 |
| 3.79 |
Thus the first estimate follows. The second is proved using the same technique.
Lemma 3.5
Let u be the solution to (2.3–2.4), then the following estimates hold
| 3.80 |
| 3.81 |
Remark 3.4
Here (3.80) will be used in the proof of the norm error estimate and (3.81) in the proof of the energy norm error estimate. As mentioned before we will use stronger control of the size of solution to the dual problem, which is used in the proof of the error estimate, close to the boundary to handle the additional factor of multiplying .
Proof
Starting from the identity (3.46) and using the triangle and Cauchy–Schwarz inequalities we obtain
| 3.82 |
| 3.83 |
| 3.84 |
for all and . Here we used the following estimates.
Term For we have using the triangle inequality, followed by the stability (2.17) and (3.29) of the extensions of f and u,
| 3.85 |
| 3.86 |
where we finally replaced f by on .
For we note that it follows from assumption (2.17) that and on , which implies on since the trace is well defined. We may therefore apply the Poincaré estimate (3.70) to extract a power of , as follows
| 3.87 |
| 3.88 |
where again we used the triangle inequality, the stability (2.17) and (3.29), and finally replaced f by on .
Term We used the Poincaré estimate (3.71) as follows
| 3.89 |
| 3.90 |
| 3.91 |
| 3.92 |
Term We used the bound (3.52) to estimate .
Factor We note that since and we have for and .
This concludes the proof of estimate (3.80). Estimate (3.81) follows by a direct estimate of the right hand side of (3.80).
Estimates of the quadrature errors
Lemma 3.6
The following estimates hold
| 3.93 |
and
| 3.94 |
Remark 3.5
Recall that and and therefore . In (3.93) we thus estimate the deviation of from the identity operator on .
Proof
(3.93): We have the estimate
| 3.95 |
| 3.96 |
where we used the uniform boundedness of , the identity , see (3.8), and, the identity , see (3.3). Next we have the identity
| 3.97 |
and thus
| 3.98 |
which together with (3.96) concludes the proof.
(3.94): Using the uniform boundedness of we obtain
| 3.99 |
Next let be the unit tangent vector to and the unit tangent vector to , oriented in such a way that and . We then have
| 3.100 |
| 3.101 |
| 3.102 |
| 3.103 |
| 3.104 |
where we used the fact that is normal to and since the vectors are parallel. Using (3.104) and adding and subtracting a suitable term we obtain
| 3.105 |
| 3.106 |
| 3.107 |
Here we used the estimates: (I) We have and thus
| 3.108 |
(II) .
Lemma 3.7
The following estimates hold
| 3.109 |
| 3.110 |
and
| 3.111 |
| 3.112 |
Remark 3.6
In fact the estimate (3.110) holds also with the factor , which is easily seen in the proof below. However, (3.110) is only used in the proof of the energy norm error estimate which is of order so there is no loss of order. We have chosen this form since it is analogous with the estimates of the right hand side (3.111)–(3.112).
Remark 3.7
We note that the estimates in Lemma 3.7 have similar form as the estimates in Lemma 3.5, which are adjusted to fit the and energy norm estimates.
Proof
(3.109)–(3.110): Starting from the definitions of the forms (2.15) and (3.35) we obtain
| 3.113 |
| 3.114 |
Term We have the estimates
| 3.115 |
| 3.116 |
| 3.117 |
where we used the estimate (3.93).
Terms and Terms II and III have the same form and may be estimated as follows
| 3.118 |
| 3.119 |
| 3.120 |
| 3.121 |
| 3.122 |
where we used (3.94) and the inverse estimate
| 3.123 |
for all . Thus we conclude that
| 3.124 |
Term We have
| 3.125 |
| 3.126 |
| 3.127 |
| 3.128 |
Estimate (3.110) follows by a direct estimate of the right hand side of (3.109).
| 3.129 |
| 3.130 |
| 3.131 |
where we used (3.8), (3.94) and (3.9). Next using the Poincaré estimate
| 3.132 |
we obtain
| 3.133 |
| 3.134 |
| 3.135 |
| 3.136 |
which are the desired estimates.
Error estimates
With the Strang Lemma 3.1 and the estimates for the interpolation, quadrature, and consistency errors at hand, we are now prepared to prove the main a priori error estimates.
Theorem 3.1
With u the solution of (2.3)–(2.4) and the solution of (2.14) the following estimate holds
| 3.137 |
Proof
Starting from the Strang Lemma and using the interpolation estimate (3.34), the quadrature error estimates (3.110) and (3.112), and the consistency error estimate (3.81), we obtain
| 3.138 |
| 3.139 |
Here, in (3.139), we used the estimate
| 3.140 |
| 3.141 |
where, in (3.141), we used the interpolation estimate (3.34) to estimate the first term and a trace inequality to estimate the second term, and finally the inequality . Thus the proof is complete since and .
Theorem 3.2
With u the solution of (2.3–2.4) and the solution of (2.14) the following estimate holds
| 3.142 |
Proof
Let be the solution to the dual problem
| 3.143 |
where on and on , and we extend using the extension operator to . Then we have the stability estimate
| 3.144 |
where the first inequality follows from the stability (3.29) of the extension of and the second is the elliptic regularity of the solution to the dual problem.
We obtain the following representation formula for the error
| 3.145 |
| 3.146 |
| 3.147 |
Term We have the estimates
| 3.148 |
| 3.149 |
| 3.150 |
| 3.151 |
| 3.152 |
Here we used the Poincaré estimate (3.71) together with the definition of the energy norm to conclude that , the stability (3.144) of the dual problem to conclude that , and finally the fact .
Term Adding and subtracting an interpolant we obtain
| 3.153 |
| 3.154 |
| 3.155 |
| 3.156 |
For the second term on the right hand side we first note that using Lemma 3.5 and Lemma 3.7 we have the estimates
| 3.157 |
| 3.158 |
| 3.159 |
| 3.160 |
where we finally used the estimates
| 3.161 |
In order to verify the estimates of Terms , we first prove the trace inequality
| 3.162 |
where the hidden constant is independent of , for small enough. Adding and subtracting , using the triangle inequality, we obtain
| 3.163 |
| 3.164 |
| 3.165 |
| 3.166 |
| 3.167 |
where in (3.164) we used equivalence of norms (3.18) for the second term and for the first term we used estimate (3.62), in (3.165) we used the trace inequality , for the second term, in (3.166) we used the bound collected the two contributions in one norm, and in (3.167) we used the stability (3.29) of the extension of v. This concludes the proof of (3.162).
Termsand Using equivalence of norms
| 3.168 |
The first term on the right hand side is handled as in (3.174)–(3.177) and the second is bounded as follows
| 3.169 |
| 3.170 |
| 3.171 |
| 3.172 |
where we added and subtracted the exact solution, used the interpolation error estimate (3.34) for the first term on the right hand side, the trace inequality (3.162) for the second term, the fact that on together with (3.52) for the third term, and finally stability of the extension operator (3.29). Thus we conclude that
| 3.173 |
Term We have
| 3.174 |
| 3.175 |
| 3.176 |
| 3.177 |
where we used equivalence of norms, added and subtracted the exact solution, used the triangle inequality and the energy norm error estimate (3.137), and the estimate
| 3.178 |
| 3.179 |
| 3.180 |
where we used (3.162).
Term Using the Cauchy–Schwarz inequality we get
| 3.181 |
Remark 3.8
Our results directly extends to the case of a Neumann or Robin condition
| 3.182 |
where on a part of the boundary. Essentially we need to modify the quadrature term estimates to account for the terms involved in the weak statement of the Robin condition. These terms are very similar to the terms involved in the Nitsche formulation for the Dirichlet problem and may be estimated in the same way.
Remark 3.9
Strong implementations of the Dirichlet boundary condition may also be considered in our framework. In this remark we summarize the main modifications in the formulation of the method and in the analysis. To formulate a finite element method with strong Dirichlet boundary conditions we need to interpolate the Dirichlet data and construct a suitable interpolation operator. Then we formulate the method and finally we discuss the modifications in the theoretical results.
Interpolation We recall that in the construction of the Scott–Zhang interpolation operator, see [22], to each Lagrange node we associate a simplex , such that and is a triangle for nodes in the interior of the discrete domain and is an edge on the boundary when . Let be the Lagrange basis associated with the simplex and let be the dual basis such that . We let denote the dual basis function associated with node i, then the nodal value , for . The interpolation operator is defined by
| 3.183 |
where N is the number of nodes and the nodal values are defined by
| 3.184 |
where we note that we use the closest point mapping for the nodes on the boundary and p for the nodes in the interior. We have the interpolation error estimate
| 3.185 |
To verify that (3.185) holds we note that it follows from (3.32) and the stability of the extension operator (3.29), that the Scott–Zhang interpolation operator , defined in (3.30), satisfies the estimate
| 3.186 |
for .
We next note that for , see the definition of the nodal values (3.31) and (3.184), and we have the inverse estimate
| 3.187 |
since for any element K with at least one vertex at the boundary we have the inverse estimates
| 3.188 |
To estimate the boundary term on the right hand side in (3.187) we proceed as follows
| 3.189 |
| 3.190 |
| 3.191 |
| 3.192 |
| 3.193 |
where we estimated the norm in terms of the nodal values on the boundary with the number of nodes at the boundary, expressed the difference using , used the Cauchy–Schwarz inequality and the bound , used the fact that each simplex (edge) occur in the sum a bounded number of times, and finally we used Lemma 3.3. We thus conclude that
| 3.194 |
where we used the fact . Adding and subtracting , using the triangle inequality, followed by the interpolation estimate (3.186) and the estimate of the difference between the interpolants (3.194) we finally obtain
| 3.195 |
| 3.196 |
| 3.197 |
| 3.198 |
Method To formulate the method we define the discrete Dirichlet data
| 3.199 |
Introducing the trial and test spaces
| 3.200 |
we have the finite element method: find such that
| 3.201 |
where
| 3.202 |
Error estimates In the analysis the following modifications are done:
- The energy norms are defined by
3.203 - In the Strang Lemma the lifted forms are simplified to
and observing that the discrete error we have3.204
and thus we may derive the Strang Lemma in the same way as for the Nitsche condition.3.205 - For the consistency error we have the simplified expression
and the estimate3.206 3.207
Combining these results we obtain energy and error estimates of the same form as in Theorems 3.1 and 3.2.
Remark 3.10
It is not necessary to use the same order of polynomials in the mappings of the elements and the finite element space. We may instead use polynomials of order for the geometry approximation and for the finite element space. See [15] for an example of an application where different approximations order are used in the context of the Darcy problem on a closed surface. Essentially, this affects the consistency error estimate in Lemma 3.5, where we will have , and the quadrature error estimates in Lemma 3.7, where we will replace k by . Clearly to obtain optimal order convergence in both the energy and the norm we must use the same or higher order polynomials in the mappings as in the finite element space, i.e., .
Numerical examples
Model problem We consider the Laplace–Beltrami problem on a torus with a part removed. To express points on the torus surface we use toroidal coordinates defined such that the corresponding Cartesian coordinates are given by
| 4.1 |
with constants and . The boundary is defined by the curves
| 4.2 |
where we choose and . In turn the domain is given by
| 4.3 |
We manufacture a problem with a known analytic solution by prescribing the solution
| 4.4 |
and compute the corresponding load f by using the identity . The Dirichlet boundary data on is directly given by . Note that (4.4) is smooth and defined on the complete torus so clearly the stability estimates (2.17) and (3.29) for f and u both hold.
Geometry discretization We construct higher order () geometry approximations from an initial piecewise linear mesh () by adding nodes for higher order Lagrange interpolation through linear interpolation between the facet vertices. All mesh nodes are moved to the exact surface by the closest point map p(x) and then the boundary is corrected such that the nodes on the discrete boundary coincide with the exact boundary . A naive approach for the correction is to just move nodes on the boundary of the mesh to the exact boundary. For our model problem we let the corrected boundary nodal points be given by the toroidal coordinates . This may however give isoparametric mappings with bad quality or negative Jacobians in some elements, especially in coarser meshes and higher order interpolations where the element must be significantly deformed to match the boundary. We therefore use a slightly more refined procedure where interior nodes are positioned inside the element according to a quadratic map aligned to the boundary, rather than using linear interpolation over the facet. In Fig. 1 a coarse mesh for the model problem using interpolation is presented.
Fig. 1.

Mesh for the model problem using geometric interpolation order and meshsize
Numerical study The numerical solution for the model problem with and is visualized in Fig. 2. We choose the Nitsche penalty parameter . This large value was chosen in order to achieve the same size of the error as when strongly enforcing the Dirichlet boundary conditions and using .
Fig. 2.

Numerical solution for the model problem using and meshsize
The results for the convergence studies in energy norm and norm are presented in Figs. 3 and 4. These indicate convergence rates of in energy norm and in norm which by norm equivalence is in agreement with Theorem 3.1 and Theorem 3.2, respectively. On coarse meshes we note some inconsistencies in the energy norm results when using higher order interpolations. We attribute this effect to large derivatives of the mappings used to make the element fit the boundary which may arise in some elements for coarse meshes that are large in comparison to the variation of the boundary. When the boundary is better resolved we retain the proper convergence rates. Note also that the Jacobian of the mapping is involved in the computation of the gradient which explains that we see this behavior in the energy norm but not in the norm.
Fig. 3.

Convergence study of the model problem in energy norm with reference lines proportional to . Note the instability in convergence rate for coarse meshes and higher order geometry approximation
Fig. 4.

Convergence study of the model problem in norm with reference lines proportional to
In the special case , such as the simplified model problem, obtained by taking parameters in the boundary description (4.2), illustrated by the mesh in Fig. 5, no correction of boundary nodes onto is needed. In that case the energy error aligns perfectly with the reference lines also for coarse meshes and higher order geometry approximations, see Fig. 6.
Fig. 5.

Mesh for a simplified version of the model problem () using geometric interpolation order and meshsize . For this problem
Fig. 6.

Convergence study for a simplified version of the model problem () in energy norm with reference lines proportional to . Note that there is no instability in convergence rate for coarse meshes
Acknowledgements
This research was supported in part by EPSRC, UK, Grant No. EP/J002313/2, the Swedish Foundation for Strategic Research Grant No. AM13-0029, the Swedish Research Council Grants Nos. 2011-4992, 2013-4708, and Swedish Strategic Research Programme eSSENCE.
References
- 1.Antonietti PF, Dedner A, Madhavan P, Stangalino S, Stinner B, Verani M. High order discontinuous Galerkin methods for elliptic problems on surfaces. SIAM J. Numer. Anal. 2015;53(2):1145–1171. [Google Scholar]
- 2.Bramble JH, Dupont T, Thomée V. Projection methods for Dirichlet’s problem in approximating polygonal domains with boundary-value corrections. Math. Comput. 1972;26:869–879. [Google Scholar]
- 3.Burman E, Claus S, Hansbo P, Larson MG, Massing A. CutFEM: discretizing geometry and partial differential equations. Int. J. Numer. Methods Eng. 2015;104(7):472–501. [Google Scholar]
- 4.Burman E, Hansbo P, Larson MG. A cut finite element method with boundary value correction. Math. Comput. 2018;87(310):633–657. [Google Scholar]
- 5.Burman E, Hansbo P, Larson MG. A stabilized cut finite element method for partial differential equations on surfaces: the Laplace–Beltrami operator. Comput. Methods Appl. Mech. Eng. 2015;285:188–207. [Google Scholar]
- 6.Burman E, Hansbo P, Larson MG, Massing A. A cut discontinuous Galerkin method for the Laplace–Beltrami operator. IMA. J. Numer. Anal. 2017;37(1):138–169. [Google Scholar]
- 7.Burman E, Hansbo P, Larson MG, Zahedi S. Cut finite element methods for coupled bulk-surface problems. Numer. Math. 2016;133(2):203–231. [Google Scholar]
- 8.Camacho F, Demlow A. and pointwise a posteriori error estimates for FEM for elliptic PDEs on surfaces. IMA J. Numer. Anal. 2015;35(3):1199–1227. [Google Scholar]
- 9.Dedner A, Madhavan P, Stinner B. Analysis of the discontinuous Galerkin method for elliptic problems on surfaces. IMA J. Numer. Anal. 2013;33(3):952–973. [Google Scholar]
- 10.Demlow A. Higher-order finite element methods and pointwise error estimates for elliptic problems on surfaces. SIAM J. Numer. Anal. 2009;47(2):805–827. [Google Scholar]
- 11.Dziuk, G.: Finite elements for the Beltrami operator on arbitrary surfaces. In: Partial Differential Equations and Calculus of Variations, Volume 1357 of Lecture Notes in Mathematics, pp 142–155. Springer, Berlin (1988)
- 12.Dziuk G, Elliott CM. Finite element methods for surface PDEs. Acta Numer. 2013;22:289–396. [Google Scholar]
- 13.Folland GB. Introduction to Partial Differential Equations. 2. Princeton: Princeton University Press; 1995. [Google Scholar]
- 14.Gilbarg D, Trudinger NS. Elliptic Partial Differential Equations of Second Order Classics in Mathematics. Reprint of the 1998 edition. Berlin: Springer; 2001. [Google Scholar]
- 15.Hansbo P, Larson MG. A stabilized finite element method for the Darcy problem on surfaces. IMA J. Numer. Anal. 2017;37(3):1274–1299. [Google Scholar]
- 16.Larson MG, Bengzon F. The Finite Element Method: Theory, Implementation, and Applications Texts in Computational Science and Engineering. Heidelberg: Springer; 2013. [Google Scholar]
- 17.Larsson K, Larson MG. A continuous/discontinuous Galerkin method and a priori error estimates for the biharmonic problem on surfaces. Math. Comput. 2017;86(308):2613–2649. [Google Scholar]
- 18.Nédélec, J.-C.: Curved finite element methods for the solution of integral singular equations on surfaces in . In: Computing Methods in Applied Sciences and Engineering (Second International Symposium, Versailles, 1975), Part 1, Lecture Notes in Economics and Mathematical Systems, vol. 134, pp. 374–390. Springer, Berlin (1976)
- 19.Nitsche, J.A.: On Dirichlet problems using subspaces with nearly zero boundary conditions. In: The Mathematical Foundations of the Finite Element Method with Applications to Partial Differential Equations (Proceedings of Symposium, University of Maryland, Baltimore, MD, 1972), pp. 603–627. Academic Press, New York (1972)
- 20.Olshanskii MA, Reusken A, Grande J. A finite element method for elliptic equations on surfaces. SIAM J. Numer. Anal. 2009;47(5):3339–3358. [Google Scholar]
- 21.Olshanskii MA, Reusken A, Xu X. A stabilized finite element method for advection-diffusion equations on surfaces. IMA J. Numer. Anal. 2014;34(2):732–758. [Google Scholar]
- 22.Scott LR, Zhang S. Finite element interpolation of nonsmooth functions satisfying boundary conditions. Math. Comput. 1990;54(190):483–493. [Google Scholar]
- 23.Scott R. Interpolated boundary conditions in the finite element method. SIAM J. Numer. Anal. 1975;12:404–427. [Google Scholar]
- 24.Wloka JT, Rowley B, Lawruk B. Boundary Value Problems for Elliptic Systems. Cambridge: Cambridge University Press; 1995. [Google Scholar]
