An optimal piecewise cubic nonconforming finite element scheme for the planar biharmonic equation on general triangulations
Shuo Zhang
LSEC, Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing 100190, People’s Republic of China
[email protected]
Abstract.
This paper presents a nonconforming finite element scheme for the planar biharmonic equation which applis piecewise cubic polynomials (P3) and possesses O(h2) convergence rate in energy norm on general shape-regular triangulations. Both Dirichlet and Navier type boundary value problems are studied. The basis for the scheme is a piecewise cubic polynomial space, which can approximate the H4 functions with O(h2) accuracy in broken H2 norm. Besides, an equivalence (∇h2 ⋅,∇h2 ⋅)=(Δh ⋅,Δh ⋅), which is usually not true for nonconforming finite element spaces, is proved on the newly designed spaces.
The finite element space does not correspond to a finite element defined with Ciarlet’s triple; however, a set of locally supported basis functions of the finite element space is still figured out. The notion of the finite element Stokes complex plays an important role in the analysis and also the construction of the basis functions.
Key words and phrases:
biharmonic equation, discretized Stokes complex, optimal finite element scheme
2000 Mathematics Subject Classification:
Primary 65N30, 35Q60, 76E25, 76W05.
The author is supported by NCMIS of CAS and NSFC Grants Nos 11471026 and 11871465.
1. Introduction
In order to obtain a simpler interior structure, in the study of the numerical analysis of partial differential equations, lower-degree polynomials are often expected to be used with respect to the same convergence rate. Finite element schemes with polynomials of degrees not higher than k for Hm problem that possess convergence rates of O(hk+1−m) in energy norm for solutions in Hk+1 are called optimal. According to [27], this illustrates both the highest accuracy with respect to certain degree of polynomials and the smallest shape function space with respect to certain convergence rate, and is a critical characteristic for the finite element methodology. Motivated by the fundamental problem aforementioned, this paper concerns the optimal finite element scheme for the biharmonic equation with piecewise cubic polynomials on general triangulations.
A brief review of relevant works
Papers on optimal schemes can be found focusing mainly on low-order problems. For the lowest-differentiation-order (H1) elliptic problems, the standard Lagrangian elements can yield optimal approximation on the simplicial grids of an arbitrary dimension. Further, the optimal nonconforming element spaces of k-th degrees are also constructed, c.f., e.g., [12], [19], and [11] for the cases k=1, k=2, and k=3, respectively, and [5] for general k. For higher-differentiation-order (Hm, m>1) elliptic problems, minimal-degree approximations have been studied with the lowest accuracy order. Specifically, when the subdivision comprises simplexes, a systematic family of nonconforming finite elements has been proposed by [39] for Hm elliptic partial differential equations in Rn for any n⩾m with polynomials with degree m. Besides, the constructions of finite element functions that do not depend on cell-by-cell definitions can be found in [32, 25, 47], wherein minimal-degree finite element spaces are defined on general quadrilateral grids for H1 and H2 problems. In contrast to these existing lowest order researches, the construction of higher-accuracy-order optimal schemes for higher-differentiation-order problems is complicated, even for the planar biharmonic problem.
Conforming finite elements for biharmonic equation requires the C1 continuity assumption. It is well-known that with polynomials of degrees k⩾5, spaces of C1 continuous piecewise polynomials can be constructed with local basis. Moreover, these spaces perform optimal approximations of H2 functions with sufficient smoothness[2, 45, 28, 44, 15]. With polynomials of degrees 2⩽k⩽4, spaces of C1 continuous piecewise polynomials can be shown to provide optimal approximation when the triangulation is of some special structures, such as the Powell–Sabin and Powell–Sabin–Heindl triangulations[34, 23, 33], criss-cross triangulations [46], Hsieh–Clough–Tocher triangulation[9], and Sander–Veubeke triangulation[36, 17]. The conditions on the grids can be relaxed, but they are generally required on at least some part of the triangulation[31, 30, 8]. On general triangulations, as is shown in [16], optimal approximation cannot be obtained with C1 continuous piecewise polynomials of degree k<5. It is illustrated in [1] that not all the basis functions can be determined locally on general grids. We would particularly recall a counterexample that, as studied in [13, 14, 4], the C1−P3 scheme is only O(h) order convergent in energy norm on a triangulation obtained by subdividing a rectangular domain with three groups of parallel lines (cf. Figure 1), which is even though one of the simplest and most regular triangulations.
In contrast, a nonconforming finite element methodology, namely, the Morley element [29], which uses piecewise quadratic polynomials with a convergence rate of O(h), was shown to perform optimally for k=2. However, to the best of our knowledge, optimal piecewise cubic or quartic finite element schemes (either conforming or nonconforming) for a planar biharmonic equation with O(h2) or O(h3) convergence rate have not been discovered. We remark that several O(h2) ordered finite element methods are designed with piecewise cubic polynomials enriched with higher-degree bubbles (e.g., [21, 38]). As the degrees of the functions exceed three, these methods are not considered optimal here. For a biharmonic problem in higher dimensions and other problems with higher orders, bigger difficulties can be expected.
Main results of the present paper
In this paper, a space Bh3 is constructed with piecewise cubic polynomials, whose subspaces Bht3 and Bh03 are proved to provide optimal approximation of H2∩H01 and H02, respectively. Finite element schemes that apply the two subspaces to the biharmonic equation with Navier and Dirichlet boundary conditions, respectively, are nonconforming, but the consistency errors are both of O(h2) order. Thus the finite element schemes are optimal, and the optimality can be proved on any shape regular grids on both convex and nonconvex polygonal domains.
Further, for any two functions wh,vh∈Bht3, it can be proved that (∇h2wh,∇h2vh)=(Δhwh,Δhvh), which is seldom true for nonconforming finite elements. This property makes the finite element spaces fit for the discretization of biLaplacian operator ΔAΔ with varying coefficient A.
Two approaches of implementing the schemes are suggested. One is to figure out their local basis functions: the finite element scheme does not correspond to a finite element in Ciarlet’s triple; but the finite element spaces do possess local basis functions that each is supported in the patch of a vertex or the patch of an edge. The other is to decompose the finite element scheme to three decoupled subproblems, which are either a Poisson system or a Stokes system, to solve sequentially. Note that the optimal solvers for discrete Poisson system and Stokes problem have been very well developed, and the latter approach suggests indeed a method to solve the finite element problem with optimal cost.
Main technical ingredient of the present paper
For the nonconforming finite element space Bh3, to control the consistency error, sufficient restrictions on the interfacial continuity have to be imposed across the edges of the cells. However, the constraints on the continuity are overdetermined in comparison to local shape functions; hence, the global finite element space do not correspond to a local finite element defined with Ciarlet’s triple. The functions can be viewed as nonsmooth splines. Consequently, several challenges arise in both theoretical analysis and practical implementation, even on counting the dimension of the space. To avoid these challenges, in this paper, indirect methods are adopted; namely, the construction and utilization of discretized Stokes complexes constitute the bulk of the task in the construction of the space and schemes. This indirect approach is viewed as the main ingredient of the paper.
Discretized Stokes complexes are finite element analogs of the 2D Stokes complexes (or the de Rham complex with enhanced regularity), which read corresponding to the boundary condition:
[TABLE]
and
[TABLE]
In the complex, the combination of the successive two operators vanish, and the kernel of the latter one is exactly the range of the former one. The finite element complexes have been widely used for stability analysis (c.f.[3]), and, in this paper, the important role they play is four-folded:
- (1)
It is used for approximation analysis. We construct two discretized Stokes complexes that start with finite element spaces Bh03 and Bht3, respectively, for H2 and estimates the approximation error of Bh03(Bht3) by estimating the discretization error of the auxiliary finite element discretization of the Stokes problem. This way, we prove the O(h2) approximation accuracy of Bh03(Bht3) in energy norm for H4 functions. Moreover, the proof does not require a convexity assumption on the domain.
2. (2)
Different from existing nonconforming finite elements such as the Morley element, for wh,vh∈Bht3, (∇h2wh,∇h2vh)=(Δhwh,Δhvh), the operations done cell by cell. This makes the finite element suitable for, e.g., ΔAΔ with varying coefficient A; see [41] for a practical application. This property is, once again, proved by the aid of the discretized Stokes complex.
3. (3)
Further, though the finite element space does not correspond to a finite element defined in Ciarlet’s triple, the finite element spaces do admit a set of basis functions, each of which is supported in a patch of a vertex or a patch of an edge. Again, the discretized Stokes complexes play crucial roles in proving the existence of the locally supported basis functions.
4. (4)
Finally, we remark, beyond bringing ease in constructing and analyzing the schemes, the discretized Stokes complex is also helpful to the implementation and numerical solution of the systems by the aid of the discretized Poisson and discretized Stokes systems; we also refer to [42, 24, 43, 50, 35, 20, 18] for relevant discussions.
Bibliographic remark
This paper collects some original results from the unpublished arXiv preprints 1805.03851([48]) authored by the same author as the present paper.
Organization of the paper
The remaining of the paper is organized as follows. Section 2 presents some finite element spaces and finite element complexes. Section 3 presents two optimal nonconforming finite element schemes, including the construction, theoretical analysis, for the two kinds of boundary value problems, respectively. Two approaches of implementation are given in Section 4. Finally, in Section 5, some conclusions and further discussions are given.
2. Finite element spaces and finite element complexes
2.1. Preliminaries
In what follows, we use Ω to denote a simply connected polygonal domain, and ∇, curl, div, rot, and ∇2 to denote the gradient operator, curl operator, divergence operator, rot operator, and Hessian operator, respectively. As usual, we use H2(Ω), H02(Ω), H1(Ω), H01(Ω), H(rot,Ω), H0(rot,Ω), and L2(Ω) to denote certain Sobolev spaces, and specifically, denote L02(Ω):={w∈L2(Ω):∫Ωwdx=0}, \undertildeH01(Ω):=(H01(Ω))2, and \undertildeHt1(Ω)=(H1(Ω))2∩H0(rot,Ω). Furthermore, we denoted vector-valued quantities by ‘‘\undertilde ", while \undertildev1 and \undertildev2 denote the two components of the function \undertildev. We use (⋅,⋅) to represent L2 inner product, and ⟨⋅,⋅⟩ to denote the duality between a space and its dual. Without ambiguity, we use the same notation ⟨⋅,⋅⟩ for different dualities, and it can occasionally be treated as L2 inner product for certain functions. We use the subscript ‘‘⋅h" to denote the dependence on triangulation. In particular, an operator with the subscript ‘‘⋅h" indicates that the operation is performed cell-by-cell. Finally, ∼= denotes equality up to a constant. The hidden constants depend on the domain, and when triangulation is involved, they also depend on the shape regularity of the triangulation, but they do not depend on h or any other mesh parameter.
Let Th be a shape-regular triangular subdivision of Ω with mesh size h, such that Ω=∪T∈ThT. Denote by Eh, Ehi, Ehb, Xh, Xhi, Xhb and Xhc the set of edges, interior edges, boundary edges, vertices, interior vertices, boundary vertices and corners, respectively. For any edge e∈Eh, denote by ne and te the unit normal and tangential vectors of e, respectively, and denote by [[⋅]]e the jump of a given function across e; if particularly e∈Ehb, [[⋅]]e stands for the evaluation of the function on e. The subscript ⋅e can be dropped when there is no ambiguity brought in.
Denote
[TABLE]
further, denote with Xhi,−(k−1)=∅,
[TABLE]
The smallest k such that Xhi,−(k−1)=Xhb,+k is called the number of levels of the triangulation.
For a triangle T, we use Pk(T) to denote the set of polynomials on K of degrees not higher than k. In a similar manner, Pk(e) is defined on an edge e. We define \undertildePk(T)=Pk(T)2 and similarly is \undertildePk(e) defined. We use ai, i=1,2,3 for the vertices of T in an anticlockwise order, ei, i=1,2,3 for the edges opposite to ai, respectively, and λi, i=1,2,3 the barycentric coordinates.
Also, we denote basic finite element spaces by
Lhk:={w∈H1(Ω):w∣T∈Pk(T), ∀T∈Th}, Lh0k:=Lk∩H01(Ω), k⩾1;
Phk:={w∈L2(Ω):w∣T∈Pk(T)}, Ph0k:=Phk∩L02(Ω), k⩾0;
\undertildeShk:=(Phk)2∩\undertildeH1(Ω), k⩾1, \undertildeShtk:=\undertildeShk∩H0(rot,Ω) and \undertildeSh0k:=\undertildeShk∩\undertildeH01(Ω);
\undertildeGhk:={\undertildev∈(Phk)2:∫epe[[\undertildevj]]=0, ∀pe∈Pk−1(e), ∀e∈Ehi, j=1,2}, k⩾1, \undertildeGhtk:={\undertildev∈\undertildeGhk:∫epe\undertildev⋅te=0, ∀e∈Ehb \mboxand pe∈Pk−1(e)}, and \undertildeGh0k:={\undertildev∈\undertildeGhk:∫epe\undertildevj=0, ∀e∈Ehb \mboxand pe∈Pk−1(e), j=1,2}.
Namely, \undertildeShk consists of continuous functions, and \undertildeGhk consists of (k−1)th order moment-continuous functions. Particularly, the space \undertildeGh2 corresponds to the famous Fortin-Soulie element [19]. The following stability result is well-known.
Lemma 1**.**
[19]**
There exists a generic constant C depending on the domain and the regularity of the grid, such that
[TABLE]
Remark 2**.**
By the symmetry between the two components of \undertildeH1(Ω), Lemma 1 remains true when “divh” is replaced by “roth.”
Denote \undertildeBh02:={\undertildeϕh:(\undertildeϕh∣T)j∈span{(λ12+λ22+λ32)−2/3}, j=1,2, ∀T∈Th} and evidently the first order moments of \undertildeϕh vanish along any edge of Th. Then \undertildeGh02=\undertildeSh02⊕\undertildeBh02 (c.f. [19]). Also \undertildeGht2=\undertildeSht2⊕\undertildeBh02. Note that, as is known, \undertildeGh2=\undertildeSh2+\undertildeBh02 is not a direct sum. The decomposition can be generalized to even k (c.f. [5]).
Lemma 3**.**
For any \undertildewh,\undertildevh∈\undertildeGht2, it holds that
[TABLE]
Proof.
Firstly, (4) holds for any \undertildewh,\undertildevh∈\undertildeSht2⊂\undertildeHt1(Ω). Secondly, (4) holds for any \undertildewh∈\undertildeGht2 and \undertildevh∈Bh0; actually, for any K∈Th,
[TABLE]
here we have used the fact that ∂n\undertildewh, div\undertildewh and rot\undertildewh are all linear polynomials along the edges of K and that the first order moments of \undertildevh vanish along the edges of K.
Now, given \undertildewh,\undertildevh∈\undertildeGht2, there exist uniquely \undertildewh1,\undertildevh1∈\undertildeSht2 and \undertildewh2,\undertildevh2∈\undertildeBh02, such that
[TABLE]
Thus
[TABLE]
and (divh\undertildewh,divh\undertildevh)+(roth\undertildewh,roth\undertildevh) can be decomposed to four corresponding parts. Then (4) can be established for every pair of the parts, and the proof is completed.
∎
Remark 4**.**
It is known that (4) holds for \undertildeHt1 functions but in general not for nonconforming finite element functions (such as the Crouzeix-Raviart element functions). This lemma reveals that the nonconforming space \undertildeGht2 is in some sense like a conforming one.
2.2. An auxiliary finite element Stokes complex
Given a grid Th, define
Ah3:={wh∈L2(Ω):wh∣T∈P3(T);wh(a) \mboxis continuous at a∈Xh};
Ah03:={wh∈Ah3:wh(a)=0 at a∈Xhb};
\undertildeGh2,r:={\undertildev∈(Ph2)2; ∫e[[\undertildev⋅te]]=0, ∀e∈Ehi};
\undertildeGh02,r:={\undertildev∈\undertildeGh2,r, ∫e\undertildev⋅te=0, ∀e∈Ehb}.
Lemma 5**.**
A finite element complex is given by
[TABLE]
Proof.
We adopt the standard counting technique.
Firstly, by Lemma 1, Ph01=roth\undertildeGh02⊂roth\undertildeGh02,r⊂Ph01. Secondly, ∇hAh03⊂{\undertildevh∈\undertildeGh02,r:roth\undertildevh=0}. Thus we only have to check if dim(∇hAh03)+dim(Ph01)=dim(\undertildeGh02,r), which can be verified by observing that dim(Ah03)=#(Xhi)+7#(Th), dim(\undertildeGh02,r)=#(Ehi)+9#(Th) and dim(\undertildePh01)=3#(Th)−1, and by the Euler formula. The proof is completed.
∎
2.3. Finite element spaces for H2 and discretized Stokes complexes
Define
[TABLE]
[TABLE]
and
[TABLE]
According to the boundary conditions on Bh03, we can recognize them as for H2 problems.
Remark 6**.**
Note that, given vh∈Bh3, on every cell, vh is embedded in 12 restrictions. We can not expect Bh3 correspond to a finite element defined with Ciarlet’s triple.
Lemma 7**.**
Bht3={wh∈Ah03:∇hwh∈\undertildeGht2}, and Bh03={wh∈Ah03:∇hwh∈\undertildeGh02}.
Proof.
Firstly, by an elementary calculus, the continuity restriction of Bh3 implies that ∫epe[[∂tvh]]=0 for any pe∈P1(e), any e∈Ehi and any vh∈Bh3. Also, ∫epe∂tvh=0 for any p3∈P1(e), any e∈Ehb and any vh∈Bht3.
By the definitions of Bh03 and Ah03, Bh03⊂{wh∈Ah03:∇wh∈\undertildeGh02}. On the other hand, given wh∈Ah03 such that ∇hwh∈\undertildeGh02, then ∫e[[∂newh]]pe=∫e[[∂tewh]]pe=0 for any e∈Eh and pe∈P1(e). This implies wh∈Bh03. Namely Bh03={wh∈Ah03:∇hwh∈\undertildeGh02}. Similarly can Bht3={wh∈Ah03:∇hwh∈\undertildeGht2} be proved, and all the proof is completed.
∎
Lemma 8**.**
It holds for wh,vh∈Bht3 that
[TABLE]
Proof.
By Lemma 3, as ∇hBht3⊂\undertildeGht2,
[TABLE]
The proof is completed.
∎
Remark 9**.**
The lemma reveals that the functions in Bht3 possess some property like the H2 conforming functions.
Theorem 10**.**
Two discretized Stokes complexex are given by
[TABLE]
and
[TABLE]
Proof.
By Lemmas 1, given ph∈Ph01, there exists \undertildeσh∈\undertildeGh02, such that roth\undertildeσh=ph. Further, given \undertildeτh∈\undertildeGh02, such that roth\undertildeτh=0, by Lemma 5, there exists wh∈Ah03, such that \undertildeτh=∇hwh. Further, by Lemma 7, wh∈Bh03. Therefore, (7) is proved. Similarly can (8) be proved.
∎
Remark 11**.**
A key feature for the proof of Theorem 10 is to construct a bigger finite element complex to cover, e.g., (7); this is accomplished by Lemma 5, where a finite element complex is constructed where the same piecewise polynomial space with lower regularity is used corresponding to (7). A dual way can be to use bigger piecewise polynomial space with the same regularity. A different proof of (7) can be found along this line in [48].
3. Optimal nonconforming finite element schemes for biharmonic equation
We consider the biharmonic equation with f∈L2(Ω):
[TABLE]
and
[TABLE]
The variational problems are respectively
to find u∈H02(Ω) such that
[TABLE]
to find z∈H2(Ω)∩H01(Ω), such that
[TABLE]
In this section, we consider the nonconforming finite element discretization for them:
find uh∈Bh03 such that
[TABLE]
find zh∈Bht3 such that
[TABLE]
By the weak continuity of Bht3, ∣⋅∣2,h (namely, ∥∇h2⋅∥0,Ω) is a norm on Bht3, and (13) and (14) are well-posed.
The main result of this section is contained in the theorem below.
Theorem 12**.**
Let u, uh, z and zh be solutions of (11) and (13), (12), and (14), respectively. Then, with a generic constant C depending on Ω and the regularity of the grid only, it holds for u,z∈Hm(Ω), m=3,4, that
[TABLE]
and
[TABLE]
Moreover, when Ω is convex,
[TABLE]
and
[TABLE]
When Ω is specifically a rectangle, δ=1.
We postpone the proof of Theorem 12 after some technical lemmas.
3.1. Approximation property of Bh03
First of all, we define an interpolator to Bh03. Given w∈H3(Ω)∩H02(Ω), set \undertildeφ:=∇w, then \undertildeφ∈\undertildeH2(Ω)∩\undertildeH01(Ω) and rot\undertildeφ=0. Indeed, (\undertildeφ,p≡0) solves the incompressible Stokes equation:
[TABLE]
Now, choose (\undertildeφh,ph)∈\undertildeGh02×Ph01 such that
[TABLE]
Then, by Theorem 10, there exists a unique wh∈Bh03 such that ∇hwh=\undertildeφh. This way, we define an interpolation operator Ih0B:H3(Ω)∩H02(Ω)→Bh03 by
[TABLE]
Lemma 13**.**
There exists a constant C such that for any w∈H02(Ω)∩Hm(Ω), m=3,4, it holds for k=2 that
[TABLE]
If Ω is convex, then (22) holds for k=1,2.
Proof.
By definition, the interpolation error of Ih0B is the discretization error of (20), and (22) can be obtained by standard technique (with Ω either convex or nonconvex).
∎
3.2. Approximation of Bht3
Again, we firstly define an interpolator to Bht3. Given w∈H3(Ω)∩H01(Ω) such that Δw∣Γ=0, set \undertildeφ:=∇w, then \undertildeφ∈\undertildeH2(Ω)∩H0(rot,Ω), rot\undertildeφ=0 and (div\undertildeφ)∣Γ=0. Indeed, (\undertildeφ,p≡0) solves the incompressible Stokes equation:
[TABLE]
Now, choose (\undertildeφh,ph)∈\undertildeGht2×Ph01 such that
[TABLE]
Then, by Theorem 10, there exists a unique wh∈Bht3 such that ∇hwh=\undertildeφh. This way, we define an interpolation operator IhtB:H3(Ω)∩H01(Ω)→Bht3 by
[TABLE]
Lemma 14**.**
There exists a constant C such that for any w∈H01(Ω)∩Hm(Ω) such that Δw∣Γ=0, m=3,4, it holds that
[TABLE]
If Ω is convex, then
[TABLE]
If specifically Ω is rectangle, κ=2.
Proof.
By definition, the interpolation error of IhtB is the discretization error of (24), and (26) and (27) can be obtained by standard technique (with Ω either convex or nonconvex). We only have to note that the regularity of the auxiliary Stokes problem on convexs domain can be affected under the boundary condition of this kind. Specifically, we refer to [6] for the full regularity of (10) and thus of the auxiliary Stokes problem (23) on rectangles.
∎
3.3. Convergence analysis of the nonconforming scheme
For suitable φ and ψ, define the bilinear forms
[TABLE]
[TABLE]
and
[TABLE]
Lemma 15**.**
There exists a constant C such that it holds for any φ∈H02(Ω)∩Hk(Ω), wh∈Bh03+H02(Ω), and k=3,4 that,
[TABLE]
[TABLE]
Proof.
Given e∈Eh, by the definition of Bh03, \fintepe[[∂newh]]e=0, pe∈P1(e); for the tangential direction, \fintepe[[∂tewh]]e=(pe(Le)[[wh]]e(Le)−pe(Re)[[wh]]e(Re))−\finte∂tepe[[wh]]e=0. Hence,
[TABLE]
Therefore, (31) follows by standard techniques.
Now, define Πh2 the nodal interpolation to Lh02 by
[TABLE]
It is easy to verify that the operator is well-defined. Moreover,
[TABLE]
By Green’s formula,
[TABLE]
Therefore,
[TABLE]
By (34),
[TABLE]
Further,
[TABLE]
Summing all above proves (37).
∎
Similarly, we have the lemma below.
Lemma 16**.**
There exists a constant C such that it holds for any φ∈H01(Ω)∩Hk(Ω) so that (Δφ)∣Γ=0, wh∈Bht3+H2(Ω)∩H01(Ω) and k=3,4 that,
[TABLE]
[TABLE]
Proof of Theorem 12
The proof follows a similar approach as the one in [37], with some technical modifications. By Strang lemma,
[TABLE]
The approximation error estimate follows by Lemma 13. By Lemma 15,
[TABLE]
which completes the proof of (15).
Now, we turn our attention to the proof of (17) for convex Ω. Denote uhΠ=Ih0Bu. Then, by Lemma 13, ∥∇hj(u−uhΠ)∥0,Ω⩽Ch4−j∣u∣4,Ω, j=1,2. Denote by Πh1 the nodal interpolation onto Lh01, then Πh1(uhΠ−uh)∈H01(Ω). Set φ∈H3(Ω)∩H02(Ω) such that
[TABLE]
then when Ω is convex, \|\varphi\|_{3,\Omega}\raisebox{-4.2679pt}{;\stackrel{{\scriptstyle\raisebox{-11.09654pt}{=}}}{{{\sim}}};}\|\Pi_{h}^{1}(u^{\Pi}_{h}-u_{h})\|_{1,\Omega}. By Green’s formula,
[TABLE]
Further, set φhΠ=Ih0Bφ, and
[TABLE]
Therefore, ∥∇Πh1(uhΠ−uh)∥0,Ω2⩽C∣φ∣3,Ω(hm−1∣u∣m,Ω+h3∥Δ2u∥0,Ω), and ∥∇Πh1(uhΠ−uh)∥0,Ω⩽C(hm−1∣u∣m,Ω+h3∥Δ2u∥0,Ω). Finally,
[TABLE]
The proof of (18) and (16) is basically the same. The convergence rate for the H1 norm of the error is slightly lost due to the lost of the regularity of the model problem (9) on general convex polygons. The proof is completed.∎
3.4. A variant formulation for bi-Laplacian equation with varying coefficient
The bi-Laplacian equation Δ(AΔu)=f, where A is a non-constant coefficient with positive lower and upper bounds, is frequently dealt with in applications. The equation arises in, e.g., the Helmholtz transmission eigenvalue problem in acoustics (c.f., e.g., [10, 26, 40]). The variational problem is to find u∈H02(Ω) such that
[TABLE]
Correspondingly, we consider the nonconforming finite element discretization:
find uh∈Bh03 such that
[TABLE]
Lemma 17**.**
The finite element problem (39) admits a unique solution.
Proof.
By Lemma 8, the bilinear form a~h(⋅,⋅) is coercive on Bh03 with respect to the norm ∣⋅∣2,h. The well-posedness of (39) follows by Lax-Milgrem lemma. The proof is completed.
∎
Similar to Theorem 12, we can establish and prove the theorem below.
Theorem 18**.**
Let u and uh be solutions of (38) and (39), respectively. Then, with a generic constant C depending on A, Ω and the regularity of the grid only, it holds for u∈Hm(Ω), m=3,4, that
[TABLE]
Moreover, when Ω is convex,
[TABLE]
Remark 19**.**
For the bi-Laplacian equation with non-constant coefficient A, the finite element scheme of the formulation (39) is a natural alternative. When the formulation (39) is used on, e.g., the Morley element, however, the scheme is not well-posed without extra stabilisations. Higher regularity of Bh03 here makes it fit for the formulation (39).
Remark 20**.**
Similarly, by Lemma 8, a bilinear form induced by (AΔh⋅,Δh⋅) can be used for Δ(AΔu)=f with Navier type boundary condition.
4. On the implementation of the schemes
In this section, we present two approaches to implement the schemes. One is to figure out the locally supported basis functions of Bh03 and Bht3, and the other is to decompose the finite element system to three sub-problems to be solved sequentially. The former approach makes the scheme fit for the general finite element programing procedure, and the latter approach, as the sub-problems are Poisson systems and a Stokes system, makes the finite element problems optimally solvable.
4.1. Locally supported basis functions of the finite element spaces
4.1.1. Structure of weakly rot-free space
Let T be a triangle with ai and ei, i=1,2,3, being its vertices and edges. Define \undertildeP2(rot,w0):={\undertildep∈\undertildeP2(T):∫Trot\undertildep=0}. Then dim(\undertildeP2(rot,w0))=11.
Denote
\undertildeηaix**: **
such that \undertildeηaix(aj)=(δij,0)⊤; \fintek\undertildeηaix=\undertilde0; i,j,k=1,2,3;
\undertildeηaiy**: **
such that \undertildeηaiy(aj)=(0,δij)⊤; \fintek\undertildeηaiy=\undertilde0; i,j,k=1,2,3.
\undertildeηai**: **
such that \undertildeηai(aj)=\undertilde0; \fintek\undertildeηai⋅tek,ai=1−δik and ∫ek\undertildeηai⋅nek,ai=0, where tek,ai is the unit tangential vector along ek starting from ai and nek,ai is the normal direction of ek; i,j,k=1,2,3;
\undertildeηei**: **
such that \undertildeηei(aj)=\undertilde0; \fintek\undertildeηei⋅\undertildeτek=0, \fintek\undertildeηei⋅nek=δik; i,j,k=1,2,3.
The functions form a frame of \undertildeP2(rot,w0). Indeed, \undertildeηe1+\undertildeηe2+\undertildeηe3=0, while we have the lemma below.
Lemma 21**.**
All \undertildeηaix, \undertildeηaiy and \undertildeηei for i=1,2,3 and any two of \undertildeηai among i=1,2,3 form a basis of \undertildeP2(rot,w0).
Analogically, denote \undertildeSh2(rot,w0):={\undertildev∈\undertildeSh2:(rot\undertildev,q)=0, ∀q∈Ph0}, \undertildeSh02(rot,w0):={\undertildev∈\undertildeSh02:(rot\undertildev,q)=0, ∀q∈Ph00} and \undertildeSht2(rot,w0):={\undertildev∈\undertildeSht2:(rot\undertildev,q)=0, ∀q∈Ph00}.
Meanwhile, for a∈Xh, denote by Pa the union of triangles of which a is a vertex, namely the patch associated with a; for e∈Eh, denote by Pe the patch associated with e. Denote, with respect to a∈Xh and e∈Eh, functions in \undertildeSh2 as,
\undertildeφax**: **
such that \undertildeφax(a)=(1,0)⊤; \undertildeφax(a′)=\undertilde0 on a=a′∈Xh; \finte′\undertildeφax=\undertilde0 on e′∈Eh;
\undertildeφay**: **
such that \undertildeφay(a)=(0,1)⊤; \undertildeφay(a′)=\undertilde0 on a=a′∈Xh; \finte′\undertildeφay=\undertilde0 on e′∈Ehi;
\undertildeφPa**: **
such that \undertildeφPa(a′)=\undertilde0 on a′∈Xh; \finte\undertildeφPa=\undertilde0 on e∈Eh and a∈e; \finte\undertildeφPa⋅te,Pa=1 and ∫e\undertildeφPa⋅ne,Pa=0 on e⊂Pa and a∈e, where te,Pa is the unit tangential vector along e starting from a and ne,Pa is the anticlockwise normal direction of e with respect to Pa;
\undertildeφe**: **
such that \finte\undertildeφe⋅\undertildeτe=0, \finte\undertildeφe⋅ne=1, and \undertildeφe vanishes on Ω∖Pe˚.
Lemma 22**.**
The set {\undertildeφax,\undertildeφay,\undertildeφPa,\undertildeφe}a∈Xhi, e∈Ehi forms a basis of \undertildeSh02(rot,w0); namely
[TABLE]
Proof.
By direct calculation, the functions \undertildeφax, \undertildeφay, \undertildeφPa and \undertildeφe all belong to \undertildeSh02(rot,w0). By their definitions, the functions {\undertildeφax,\undertildeφay,\undertildeφe}a∈Xhi, e∈Ehi are linearly independent, and the summation span{\undertildeφPa}a∈Xhi+span{\undertildeφax,\undertildeφay,\undertildeφe}a∈Xhi, e∈Ehi is direct. Since dim(\undertildeSh02(rot,w0))=dim(\undertildeSh02)−dim(Ph00)=#((N)h0i)+3#(Xh0i), it remains for us to show {\undertildeφe}e∈Ehi are linearly independent.
Assume there exist {αa}a∈X⊂R with αa=0 for a∈Xhb, such that \undertildeψ=∑a∈Xhαa\undertildeφPa≡0. By the definition of \undertildeφPa, for any e∈Ehi, ∣\finte\undertildeψ⋅ne∣=∣αaeL−αaeR∣, where aeL and aeR are the two ends of e; thus αaeL=αaeR for every e∈Ehi. Since αa=0 for a∈Xhb, αa=0 for a∈Xhb,+1; recursively, we obtain αa=0 for a∈Xhb,+j level by level, and finally αa=0 for a∈Xh.
The proof is completed by noting the two sides of (42) have the same dimension.
∎
For a∈Xhb∖Xhc, denote by nab the outward unit normal vector of ∂Ω at a. Thus, for a∈Xhb∖Xhc, denote
[TABLE]
Lemma 23**.**
\undertildeSht2(rot,w0)=\undertildeSh02(rot,w0)⊕span{\undertildeφab:a∈Xhb∖Xhc}⊕span{\undertildeφe:e∈Ehb}.
Proof.
By Lemma 21, \undertildeφab with a∈Xhb∖Xhc are linearly independent, and the right hand side is a direct sum included in the left hand side. On the other hand,
[TABLE]
This proves the assertion.
∎
4.1.2. Structure of piecewise rot-free space
Denote \undertildeP2(rot,0)={\undertildep∈\undertildeP2(T):rot\undertildep=0}, and dim(\undertildeP2(rot,0))=9. Denote by ϕT the bubble function (λ12+λ22+λ32)−2/3, and define a mapping FT from \undertildeP2(rot,w0) to \undertildeP2(rot,0) by
[TABLE]
Since ∫Trot\undertildeη=0 in the formula above, the mapping is well defined. It can be verified that FT(\undertildeηa1x+\undertildeηa2x+\undertildeηa3x)=0 and FT(\undertildeηa1y+\undertildeηa2y+\undertildeηa3y)=0. A frame of \undertildeP2(rot,0) is presented in the lemma below.
Lemma 24**.**
Any two FT\undertildeηaix among i=1,2,3, any two FT\undertildeηaiy among i=1,2,3, any two FT\undertildeηai among i=1,2,3, and all FT\undertildeηei for i=1,2,3 form a basis of \undertildeP2(rot,0).
Denote \undertildeGh2(rot,0):={\undertildev∈\undertildeGh2:roth\undertildev=0}, \undertildeGh02(rot,0):={\undertildev∈\undertildeGh02:roth\undertildev=0} and \undertildeGht2(rot,0):={\undertildev∈\undertildeGht2:roth\undertildev=0}. Define an operator Fh:\undertildeSh2(rot,w0)→\undertildeGh2(rot,0) by
[TABLE]
Since ∫Trot\undertildeφh=0 on any T for \undertildeφh∈\undertildeSh2(rot,w0), Fh is well defined. Indeed, (Fh\undertildeφh)∣T=FT(\undertildeφh∣T).
Lemma 25**.**
Fh* is a bijection between \undertildeSh02(rot,w0):={\undertildev∈\undertildeSh02:(rot\undertildev,q)=0, ∀q∈Ph00} and \undertildeGh02(rot,0):={\undertildev∈\undertildeGh02:roth\undertildev=0}, and a bijection between \undertildeSht2(rot,w0):={\undertildev∈\undertildeSht2:(rot\undertildev,q)=0, ∀q∈Ph00} and \undertildeGht2(rot,0):={\undertildev∈\undertildeGht2:roth\undertildev=0}.*
Proof.
Since \undertildeSht2∩\undertildeBh0={0}, Fh is an injection on \undertildeSht2(rot,w0).
Given \undertildeγh∈\undertildeGht2(rot,0), decompose it to \undertildeγh=\undertildeγh1+\undertildeγh2 such that \undertildeγh1∈\undertildeSht2 and \undertildeγh2∈\undertildeBh0. As rot(\undertildeγh∣T)=0 and ∫Trot(ϕT,0)=∫Trot(0,ϕT)=0 on every cell T, ∫Trot(\undertildeγh1∣T)=0. Namely \undertildeγh1∈\undertildeSht2(rot,w0). This way Fh is a bijection between \undertildeSht2(rot,w0) and \undertildeGht2(rot,0).
Similarly we can prove Fh\undertildeSh02(rot,w0)=\undertildeGh02(rot,0), and the proof is completed.
∎
By Lemmas 22, 22 and 25, we can prove the lemmas below.
Lemma 26**.**
The set {Fh\undertildeφax,Fh\undertildeφay,Fh\undertildeφPa,Fh\undertildeφe}a∈Xhi, e∈Ehi forms a basis of \undertildeGh02(rot,0).
Lemma 27**.**
\undertildeGht2(rot,0)=\undertildeGh02(rot,0)⊕span{Fh\undertildeφab:a∈Xhb∖Xhc}⊕span{Fh\undertildeφe:e∈Ehb}.
4.1.3. Locally supported basis functions of Bh03 and Bht3
Now we are going to show that Bh03 admits a set of basis functions with vertex-patch-based supports.
Theorem 28**.**
The space Bh03 admits a set of basis functions each is supported in a patch of some vertex.
Proof.
By the exact sequence (7), we got to know that the piecewise gradient ∇h is a bijection between Bh03 and \undertildeGh02(rot,0). Further, by Lemma 26, the set
[TABLE]
form a basis of Bh03. Note again that both (∇h)−1 and Fh preserve the locality of the support; this is verified by viewing the patch as a specific triangulation. Namely (45) is a basis each supported in the patch of a vertex. The proof is completed.
∎
Similar to Theorem 28, we have the description below.
Theorem 29**.**
The space Bht3 admits a set of basis functions each is supported in a patch of some vertex.
Proof.
By the complex (8), again, ∇h is a bijection between Bht3 and \undertildeGht2(rot,0). By Lemma 27,
[TABLE]
and a locally supported basis of Bht3 follows. The proof is completed.
∎
We use the notation below for convenience:
[TABLE]
[TABLE]
[TABLE]
We remark here all these w′s can be obtained by straightforward calculation, as, again, both (∇h)−1 and Fh preserve the locality of the supports and can be done cell by cell. Though the space Bh3 does not correspond to a finite element defined by Ciarlet’s triple, these w′s play the same role as that by the usual nodal basis functions. Substituting these functions into the common routine generates finite element codes of the schemes (13) and (14) in a standard way.
4.2. Implementation by decomposition
In this subsection, alternatively, we suggest a decomposition procedure, and the schemes (13) and (14) can be implemented without the explicit construction of the basis functions.
Lemma 30**.**
Let uh∗ be obtained by the following procedure:
- (1)
find rh∈Ah03 such that
[TABLE]
2. (2)
with rh obtained, find (\undertildeφh,ph)∈\undertildeGh02×Ph01 such that
[TABLE]
3. (3)
with \undertildeφh obtained, find uh∗∈Ah03 such that
[TABLE]
Let uh be the solution of (13). Then, uh∗=uh.
Lemma 31**.**
Let zh∗ be obtained by the following procedure:
- (1)
find rh∈Ah03 such that
[TABLE]
2. (2)
with rh obtained, find (\undertildeφh,ph)∈\undertildeGht2×Ph01 such that
[TABLE]
3. (3)
with \undertildeφh obtained, find zh∗∈Ah03 such that
[TABLE]
Let zh be the solution of (14). Then, zh∗=zh.
Lemmas 30 and 31 follows from Theorem 10 and Lemma 7. The scheme (49) is not a convergent one for the Poisson equation, but it is well-posed based on the continuity of Ah03 on vertices. With the formulations presented in Lemmas 30 and 31, the spaces used for Poisson equations and Stokes problems only are easy to formulate; to solve the system only needs solving two Poisson systems and one Stokes systems one by one, each of which can be solved with various optimal solvers in a friendly way.
Remark 32**.**
The decompositions as in Lemmas 30 and 31 can also be established for (39) and the one in Remark 20, respectively.
5. Conclusion and discussion
In this paper, based on theoretical analysis by an indirect approach, a constructive answer is given to the question if an optimal scheme can be designed for the biharmonic equation with piecewise cubic polynomials on general triangulations; the schemes work optimally, e.g., on triangulations shown in Figure 1. Beside the theoretical meaning, the scheme can find its application onto practical problems. For example, a high order scheme has been implemented based on Bh3 for the Helmholtz transmission eigenvalue problem from inverse scattering and accoustics in [41]; we refer there for many numerical experiments about schemes with Bh3. The practical usage of the scheme can be thus illustrated.
This paper relies on construction and utilization of discretized Stokes complexes based on the \undertildeGh02−Ph01 pair. The space \undertildeGhk with k=3 corresponds to the Crouzeix–Falk pair studied in [11]. In that paper, the authors proved that the pair \undertildeGh03−Ph02 is stable “for most reasonable meshes.” Moreover, they presented a conjecture that the pair is stable “for any triangulation of a convex polygon satisfying the minimal angle condition and containing an interior vertex.” Recently, some triangulations where \undertildeGh03−Ph02 is stable or at least div\undertildeGh03=Ph02 are introduced in [22]. This hints the possibility to generalize the concept for optimal quartic element schemes (see [48] for details).
It is worthwhile pointing out, in this paper, we focus on the primal schemes only. There have been various kinds of schemes that considered new variables and/or conduct the second order differentiation in a dual way, such as the mixed element method, local DG method, hybridized DG method, CDG method, weak Galerkin method, and so forth. We remark that the literature on related works in this context is vast, but we will not discuss them in this paper. Moreover, based on the space Bh03(Bht3), DG schemes can be designed. One may be able to construct, for example, a weakly over-penalized IP method (like [7]) or IPDG method with optimal convergence rate robust with respect to the penalization paremeter ([49]) with piecewise cubic polynomials.
The spaces Ah3 and Bh3 each belongs to a systematic family which reads:
[TABLE]
and
[TABLE]
The spaces Ah0k and Bh0k can be defined corresponding to the boundary conditions of H01(Ω) and H02(Ω), respectively. It is now known that Bh(0)k is an optimally consistent finite element space for biharmonic equation (k=2,3) for arbitrary triangulations. For k=4, as discussed above, the assertion holds on most “reasonable” triangulations. Can the family work optimally with arbitrary k⩾2 and can it be generalized to a higher dimension and even higher-order problems? This question could be of interest in future research.