Nitsche's method for a Robin boundary value problem in a smooth domain
Yuki Chiba, Norikazu Saito

TL;DR
This paper establishes optimal error estimates for Nitsche's finite-element method applied to Robin boundary value problems in smooth domains, analyzing the influence of penalty parameters and confirming results with numerical examples.
Contribution
It provides new optimal error estimates for Nitsche's method applied to Robin problems, including the optimal relation between mesh size and penalty parameter, without requiring strong regularity assumptions.
Findings
Optimal error estimates are derived for the method.
The dependence of error on the penalty parameter is clarified.
Numerical examples confirm theoretical results.
Abstract
We prove several optimal-order error estimates for a finite-element method applied to an inhomogeneous Robin boundary value problem (BVP) for the Poisson equation defined in a smooth bounded domain in , . The boundary condition is weakly imposed using Nitsche's method. The Robin BVP is interpreted as the classical penalty method with the penalty parameter . The optimal choice of the mesh size relative to is a non-trivial issue. This paper carefully examines the dependence of on error estimates. Our error estimates require no unessential regularity assumptions on the solution. Numerical examples are also reported to confirm our results.
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 · Advanced Mathematical Modeling in Engineering
Nitsche’s method for a Robin boundary value problem in a smooth domain
Yuki Chiba
Graduate School of Mathematical Sciences, The University of Tokyo, Komaba 3-8-1, Meguro, Tokyo 153-8914, Japan
and
Norikazu Saito
Graduate School of Mathematical Sciences, The University of Tokyo, Komaba 3-8-1, Meguro, Tokyo 153-8914, Japan
[email protected] http://www.infsup.jp/saito/index-e.html
Abstract.
We prove several optimal-order error estimates for a finite-element method applied to an inhomogeneous Robin boundary value problem (BVP) for the Poisson equation defined in a smooth bounded domain in , . The boundary condition is weakly imposed using Nitsche’s method. The Robin BVP is interpreted as the classical penalty method with the penalty parameter . The optimal choice of the mesh size relative to is a non-trivial issue. This paper carefully examines the dependence of on error estimates. Our error estimates require no unessential regularity assumptions on the solution. Numerical examples are also reported to confirm our results.
Key words and phrases:
finite element method, Nitsche’s method
2000 Mathematics Subject Classification:
Primary 65N15, Secondary 65N30
1. Introduction
Nitsche’s method [16] is well-known as a powerful method for imposing the Dirichlet boundary condition (DBC) in the finite element method (FEM). DBC is usually imposed by specifying the function values themselves at boundary nodal points. In contrast, Nitsche’s method is based on the method of “weak imposition” of DBC using penalty parameter. Actually, this strategy is useful for resolving the issue of spurious oscillations for non-stationary Navier–Stokes and convection–diffusion equations as was mentioned in Bazilevs et al. [6, 7].
In recent years, demand for computing complex boundary conditions has been increasing. Boundary conditions involving the Laplace–Beltrami operator, such as a dynamic boundary condition and a generalized Robin boundary condition play important roles in application to the reduced fluid–structure interaction model and Cahn–Hilliard equation (see, e.g., [10], [17] and [8]). Nitsche’s method may be an effective approach to address these boundary conditions, and therefore, is worthy of a thorough investigation.
When numerically solving PDEs in a smooth domain, we often utilize polyhedral approximations of the domain. Generally, a facile approximation of the problem may result in a wrong numerical solution; the so-called Babuška’s paradox in [2, §5] is a remarkable example. Therefore, investigating not only the error caused by discretizations but also that caused by domain approximations is important. For the standard FEM, approximating domains is a common problem, and analysis of the energy norm is well-developed thus far. Only recently, the optimal order and stability and error estimates were established; refer to [13] for detail.
Consequently, we evaluate Nitsche’s method for PDEs in a smooth bounded domain. We study a finite-element method (FEM) applied to an inhomogeneous Robin boundary value problem (BVP) for the Poisson equation defined in a smooth bounded domain in , . The boundary condition on the boundary is weakly imposed using Nitsche’s method. We then derive several optimal-order error estimates under reasonable regularity assumptions on the solution. Specifically, we consider
[TABLE]
instead of (1.1b).
The case of a polyhedral domain with has already been addressed in Juntunen and Stenberg [11]. We are motivated by [11] and this paper is a generalization of [11] to a smooth domain. We study simultaneously the case , that is the case of DBC.
If we are concerned with the Dirichlet BVP (1.1a) and (1.1c), the Robin BVP (1.1a) and (1.1b) with implies the classical penalty method with the penalty parameter . (The is interpreted as the penalty parameter in the classical penalty method. On the other hand, Nitsche’s method is introduced using the penalty parameter, which we will write as . The readers have to care not to confuse.) FEM for this method is well studied so far; we refer to [3, 4, 5, 15] for example. In particular, Barret and Elliott [4] presented the error estimate in a smooth domain as
[TABLE]
Therein, denotes the granularity parameter of the triangulation and denotes a polyhedral approximation of satisfying (2.2). (See also Remark 2.3.) The continuous finite element solution is represented by . The definition of function spaces and their norms are described in the end of this section. Moreover, and are suitable extensions of and , respectively. The precise definition will be mentioned in the next section. The estimate (1.2) gives the optimal-order estimate for the norm by setting . However, we need a surplus regularity . Barret and Elliott [5] later studied the iso-parametric FEM for a similar problem and obtained similar results as ours. However, regularity assumptions slightly vary from ours.
This paper carefully examines the dependence of on error estimates. As a matter of fact, how to choose relative to is a non-trivial issue for smooth domain cases. A suitable regularity assumption is another non-trivial issue as we recalled for the standard FEM above. This point was not discussed in Juntunen and Stenberg [11], because these issues do not appear in polyhedral cases. In fact, we succeed in deriving (see Theorem 1)
[TABLE]
where denotes the DG norm defined as (2.10). Consequently, we deduce the optimal-order estimate for the DG norm by setting under no further assumptions the smoothness of the solution and data. It makes this possible by applying some estimates reported in [13]. On the other hand, we assume a surplus regularity , , for deducing the optimal-order estimate for the norm (see Theorem 2). In our opinion, this is an essential requirement; see Remark 2.2 and Section 6.
This paper comprises six sections. In Section 2, the continuous finite element approximation using Nitsche’s method and the main error estimates (Theorems 1 and 2) are described. After having presented some preliminary results in Section 3, we prove Theorems 1 and 2 in Sections 4 and 5, respectively. Finally, numerical examples are also reported to confirm our results in Section 6.
Notation
We list the notations used in this paper. We follow the standard notation of, for example, [1] for function spaces and their norms. In particular, for and a positive integer , we use the standard Lebesgue space and Sobolev space . Hereinafter, denotes a bounded domain in . The inner product and norm of are denoted, respectively, by and . The norm of is denoted by . As usual, we set , and the semi-norm and norm of are denoted by, respectively,
[TABLE]
For , we define using a surface measure in a common approach. The inner product and norm of is denoted by, respectively, and . Moreover, denotes the set of all polynomials in of degree .
2. Nitsche’s method and the main results
We recall that is a bounded domain in , . Throughout this paper, we assume that the boundary of is a boundary, where is an integer .
From the general theory of elliptic PDEs, we know that the unique solution of (1.1) belongs to and satisfies , where denotes a positive constant depending only on and . The pure Neumann problem is out of our interest. Therefore, we assume
[TABLE]
for a suitably large .
Let be a regular family of triangulations of a polyhedral domain in the sense of [9]. That is,
- (1)
is a set of closed -simplices (elements) , and
[TABLE] 2. (2)
The granularity parameter is defined as , where denotes the diameter of ; 3. (3)
Any two elements of meet only in entire common faces or sides or in vertices; 4. (4)
There exists a positive constant satisfying for all , where denotes the diameter of the inscribed ball of .
We then introduce the boundary mesh inherited from by
[TABLE]
and the boundary is expressed as . We assume that is an approximate surface/polygon of in the sense that
[TABLE]
We use the continuous finite element space
[TABLE]
Below we fix a sufficiently smooth domain such that
[TABLE]
Since is of class , , the domain admits a strong -extension operator . That is, is a linear operator of for any and , and it satisfies
[TABLE]
where denotes a positive constant depending only on , and ; see [1, Theorem 5.22] for example. Using this, we write
[TABLE]
Following [11], we set
[TABLE]
where is a penalty parameter, the diameter of , and the outer unit normal vector to .
Nitsche’s method for (1.1) is stated as follows:
[TABLE]
We use the following norms that depend on and :
[TABLE]
We recall that and are equivalent on uniformly in . That is, there exists a positive constant independent of such that
[TABLE]
Here and hereinafter, denotes a generic positive constant which is independent of and . The value of may be different at each occurrence. The inequalities (2.11) follow from the well-known inequality
[TABLE]
In fact, (2.12) is a readily obtainable consequence of the standard trace inequality,
[TABLE]
Nitsche’s method (2.8) admits a unique solution in view of the following basic result; see [11, Theorem 3.2].
Lemma 2.1**.**
We have
[TABLE]
Actually, can be taken as any positive number strictly smaller than , where denotes the constant appearing in (2.12); see [11, Theorem 3.2]. Below we always assume that
[TABLE]
To deduce convergence results, we need an inverse assumption as
[TABLE]
We are now in a position to state our main result. We recall that denotes a positive constant which is independent of and .
Theorem 1** ( estimates).**
Suppose that is a boundary. Let and represent the solutions of (1.1) and (2.8), respectively. Assume that (2.2), (2.15) and (2.16) are satisfied. Then, if , we have
[TABLE]
where . If , we have
[TABLE]
Theorem 2** ( estimates).**
Suppose that is a boundary. Let and represent the solutions of (1.1) and (2.8), respectively. Assume that (2.2), (2.15) and (2.16) are satisfied. Then, if , for some , and , we have
[TABLE]
where . On the other hand, if and , we have
[TABLE]
Remark 2.2*.*
Theorem 1 reports that the optimal rate of convergence for the error is achieved under a reasonable (minimal) regularity assumption on . On the other hand, we pose a somewhat surplus regularity , , for deducing the optimal rate of convergence for the error. In our opinion, this is an essential requirement. Actually, a numerical example reported in Section 6 shows the second-order convergence may not take place if , .
Remark 2.3*.*
We are assuming (2.2) for . This can be replaced by
[TABLE]
with some obvious modification of proofs.
3. Boundary-skin estimates
We collect some auxiliary results that will be used in the proof of the main results.
Since is a bounded domain, there exists a local coordinate system to ensure the following:
is an open covering of . 2. 2)
For any , there exists a congruent transformation such that , where is the original coordinate. 3. 3)
For any , is a function in and is a graph of with respect to the coordinate .
Assuming that is sufficiently small if necessary, our possible assumptions are as follows:
For any , there exists a function such that is a graph of with respect to the coordinate .
In addition, we assume that is sufficiently small to ensure that for any and , the open ball with center and radius is contained in a neighborhood . Let be the signed distance function defined by
[TABLE]
We define , which we call the boundary-skin region. Then, for a sufficiently small , the orthogonal projection onto exists such that
[TABLE]
Because is sufficiently small, is defined on and for each , and comprises some local neighborhood . In this case, has the inverse operator , and . Moreover, is a partition of .
We assume that all these properties hold for any by assuming that is sufficiently small if necessary.
Now we can state the boundary-skin estimates. For the proof, refer to [14, Theorems 8.1, 8.2, and 8.3 and Lemma 9.1] and [13, Lemma A.1].
Lemma 3.1** (Boundary-skin estimates).**
Let with a positive constant . We have
[TABLE]
Lemma 3.2**.**
[TABLE]
- Proof.
It is a direct consequence of (3.2d) in view of (2.1) and (2.15). ∎
Lemma 3.3**.**
[TABLE]
- Proof.
First, consider the case . Let be a constant satisfying as in Lemma 3.1. Since on , we have by (3.2b)
[TABLE]
which implies (3.4a). Therein, we have used and , which are direct consequences of (3.2c) and the trace theorem.
We proceed to the case . Since on , we have
[TABLE]
As above, we estimate as
[TABLE]
On the other hand, by (3.2b) and (3.2a)
[TABLE]
Summing up, we deduce (3.4b). ∎
4. Proof of Theorem 1
We start with a version of the Strang lemma. To state it, we set
[TABLE]
for and .
Lemma 4.1**.**
Under the same assumption of Theorem 1, we have
[TABLE]
- Proof.
Letting and , we have
[TABLE]
where (2.14b), (2.14a), and (2.11) are applied. This, together with the triangular inequality, implies (4.2) ∎
The standard Lagrange interpolation operator of is denoted by . It is well-known that
[TABLE]
As a direct application of (4.3) and (2.13), we derive
[TABLE]
We can state the following proof.
- Proof of Theorem 1.
First consider the case . In view of (4.2) and (4.4), it suffices to prove
[TABLE]
Let be arbitrary. Applying the integrate by parts, we have
[TABLE]
Since in , we have by (3.3)
[TABLE]
Using (3.4b),
[TABLE]
Summing up, we deduce (4.5).
We proceed to the case . It suffices to prove
[TABLE]
In this case, we have , where
[TABLE]
We apply (2.16) and (3.4a) to obtain
[TABLE]
where . Therefore, (4.8) is proved. ∎
5. Proof of Theorem 2
We use the Green operator defined as follows. For , is the unique solution of
[TABLE]
For any , admits the a priori estimate
[TABLE]
In particular, does not depend on . We omit the proof since it is outside the scope of this paper. As a matter of fact, this can be verified by a standard method of difference quotient. For example, if tracing the proof of [12, Theorem 3.3] carefully, we find that the estimate (5.2) holds true. Moreover, if is a boundary, the same proof of [18, Lemma 4.1] is also applicable.
Lemma 5.1**.**
Under the same assumption of Theorem 2, we have
[TABLE]
where , and
[TABLE]
- Proof.
First, suppose that . In the similar way as the derivation of (4.6), we deduce
[TABLE]
for and .
Let and . We use the same symbol to express the zero extension of into . Substituting (5.4) for and , we obtain
[TABLE]
Thanks to (5.2), an estimation for is readily;
[TABLE]
We apply Lemma 3.3 with and and derive
[TABLE]
Summing up, we deduce
[TABLE]
Finally, using (2.14a) and (5.2), we deduce (5.3) for .
If , is replaced by
[TABLE]
We apply Lemma 3.3 with and get
[TABLE]
Therefore, (5.3) holds even for . ∎
We finally state the following proof.
- Proof of Theorem 2.
We define following bilinear and linear forms:
[TABLE]
Then, we obtain
[TABLE]
First consider the case . Since and are continuous in , we have
[TABLE]
Using (3.2c), we obtain
[TABLE]
Given that
[TABLE]
we have
[TABLE]
Using (3.2a), we obtain
[TABLE]
Using (5.1b) and (3.2b), we have
[TABLE]
Hence, we obtain
[TABLE]
We rearrange as
[TABLE]
Using boundary skin estimates, we get
[TABLE]
Therein, we used the Sobolev inequality and (2.5) to derive
[TABLE]
(To apply (2.5) we are assuming that is a boundary.)
Therefore, we deduce
[TABLE]
Similarly, we have
[TABLE]
is rewritten as
[TABLE]
Using boundary skin estimates and (5.1b), we can perform estimations as
[TABLE]
and
[TABLE]
Moreover,
[TABLE]
So, we get
[TABLE]
Summing up, we deduce
[TABLE]
We apply (3.4b), we obtain
[TABLE]
Consequently,
[TABLE]
Using the same way as the proof of (4.5), we derive
[TABLE]
for . By substituting this for , we have
[TABLE]
Finally, we have
[TABLE]
and we obtain the estimate (2.19).
We proceed to the case . We replace by
[TABLE]
and by
[TABLE]
Using (3.2a) and (3.2b), we have
[TABLE]
Using (3.4a) and (3.2b), we obtain
[TABLE]
Since , we get
[TABLE]
Using (3.4a), we have
[TABLE]
Hence, we obtain
[TABLE]
Therefore, (2.20) is proved. ∎
6. Numerical examples
In this section, we present some numerical results to verify the validity of our error estimates. We consider the Poisson problem (1.1) in a disk .
First, we confirm the validity of the estimates in Theorems 1 and 2. We set , and so that a function solves (1.1). Let be the solution of (2.8). Figure 1 shows the the error and the error for . We observe that the convergence rates are almost for the error and for the error. Thus, the optimal convergence rates actually take place and the estimates of Theorems 1 and 2 are confirmed.
Subsequently, we consider the exact solution and the corresponding , , and . Let . In this case, and for any . That is, the assumption of Theorem 2 does not satisfied. Figure 2 reports the error and the error for . We see from Figure 2 that the convergence rate for the error is . However, the second-order convergence does not achieve for the error. Actually, we observe that the convergence rate for the error is with some small . This result is consistent with Theorem 2. Therefore, we can conclude that the regularity condition with is an essential requirement for deducing the optimal order convergence.
Acknowledgements
This work was supported by CREST (JPMJCR15D1) of JST, Japan, by Grant-in-Aid for Scientific Research B (15H03635) of JSPS, Japan, and by Grant-in-Aid for Scientific Research A (21H04431) of JSPS, Japan.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. A. Adams and John J. F. Fournier. Sobolev spaces , volume 140 of Pure and Applied Mathematics (Amsterdam) . Elsevier/Academic Press, Amsterdam, second edition, 2003.
- 2[2] I. Babuška. The theory of small changes in the domain of existence in the theory of partial differential equations and its applications. In Differential Equations and Their Applications (Proc. Conf., Prague, 1962) , pages 13–26. Publ. House Czechoslovak Acad. Sci., Prague; Academic Press, New York, 1963.
- 3[3] I. Babuška. The finite element method with penalty. Math. Comp. , 27:221–228, 1973.
- 4[4] J. W. Barrett and C. M. Elliott. Finite element approximation of the Dirichlet problem using the boundary penalty method. Numer. Math. , 49(4):343–366, 1986.
- 5[5] J. W. Barrett and C. M. Elliott. Finite-element approximation of elliptic equations with a Neumann or Robin condition on a curved boundary. IMA J. Numer. Anal. , 8(3):321–342, 1988.
- 6[6] Y. Bazilevs and T. J. R. Hughes. Weak imposition of Dirichlet boundary conditions in fluid mechanics. Comput. & Fluids , 36(1):12–26, 2007.
- 7[7] Y. Bazilevs, C. Michler, V. M. Calo, and T. J. R. Hughes. Weak Dirichlet boundary conditions for wall-bounded turbulent flows. Comput. Methods Appl. Mech. Engrg. , 196(49-52):4853–4862, 2007.
- 8[8] L. Cherfils, M. Petcu, and M. Pierre. A numerical analysis of the Cahn-Hilliard equation with dynamic boundary conditions. Discrete Contin. Dyn. Syst. , 27(4):1511–1533, 2010.
