On the superconvergence of a hydridizable discontinuous Galerkin method for the Cahn-Hilliard equation
Gang Chen, Daozhi Han, John Singler, Yangwen Zhang

TL;DR
This paper introduces a hybridizable discontinuous Galerkin (HDG) method for the Cahn-Hilliard equation, demonstrating optimal convergence and superconvergence properties, supported by theoretical analysis and numerical validation.
Contribution
The work develops a novel HDG Sobolev inequality and proves superconvergence of scalar variables in the HDG method for nonlinear PDEs.
Findings
Optimal convergence rates in $L^2$ norm for all variables.
Superconvergence of scalar variables in globally coupled degrees of freedom.
Numerical results confirm theoretical convergence rates.
Abstract
We propose a hydridizable discontinuous Galerkin (HDG) method for solving the Cahn-Hilliard equation. The temporal discretization can be based on either the backward Euler method or the convex-splitting method. We show that the fully discrete scheme admits a unique solution, and we establish optimal convergence rates for all variables in the norm for arbitrary polynomial orders. In terms of the globally coupled degrees of freedom, the scalar variables are superconvergent. Another theoretical contribution of this work is a novel HDG Sobolev inequality that is useful for HDG error analysis of nonlinear problems. Numerical results are reported to confirm the theoretical convergence rates.
| 1/4 | 1/8 | 1/16 | 1/32 | 1/64 | |
|---|---|---|---|---|---|
| 8.6745E-04 | 4.8767E-04 | 2.5058E-04 | 1.2614E-04 | 6.3177E-05 | |
| order | - | 0.83088 | 0.96061 | 0.99025 | 0.99757 |
| 8.9032E-04 | 4.9104E-04 | 2.5102E-04 | 1.2620E-04 | 6.3184E-05 | |
| order | - | 0.85847 | 0.96803 | 0.99214 | 0.99804 |
| 2.5400E-04 | 6.6287E-05 | 1.6746E-05 | 4.1975E-06 | 1.0501E-06 | |
| order | - | 1.9380 | 1.9849 | 1.9962 | 1.9990 |
| 2.6147E-04 | 6.7626E-05 | 1.7040E-05 | 4.2683E-06 | 1.0676E-06 | |
| order | - | 1.9510 | 1.9887 | 1.9972 | 1.9993 |
| 1/4 | 1/8 | 1/16 | 1/32 | 1/64 | |
|---|---|---|---|---|---|
| 1.6623E-04 | 4.5233E-05 | 1.1599E-05 | 2.9202E-06 | 7.3141E-07 | |
| order | - | 1.8778 | 1.9634 | 1.9899 | 1.9973 |
| 1.6700E-04 | 4.5276E-05 | 1.1602E-05 | 2.9204E-06 | 7.3142E-07 | |
| order | - | 1.8830 | 1.9644 | 1.9901 | 1.9974 |
| 4.8698E-05 | 6.1714E-06 | 7.7349E-07 | 9.6742E-08 | 1.2094E-08 | |
| order | - | 2.9802 | 2.9962 | 2.9992 | 2.9998 |
| 4.9152E-05 | 6.1862E-06 | 7.7391E-07 | 9.6753E-08 | 1.2095E-08 | |
| order | - | 2.9901 | 2.9988 | 2.9998 | 3.0000 |
| 1/4 | 1/8 | 1/16 | 1/32 | 1/64 | |
|---|---|---|---|---|---|
| 8.6761E-04 | 4.8768E-04 | 2.5059E-04 | 1.2614E-04 | 6.3177E-05 | |
| order | - | 0.83111 | 0.96063 | 0.99025 | 0.99757 |
| 8.9460E-04 | 4.9143E-04 | 2.5107E-04 | 1.2620E-04 | 6.3185E-05 | |
| order | - | 0.86427 | 0.96891 | 0.99232 | 0.99809 |
| 2.5759E-04 | 6.7122E-05 | 1.6952E-05 | 4.2490E-06 | 1.0629E-06 | |
| order | - | 1.9402 | 1.9853 | 1.9963 | 1.9991 |
| 2.6295E-04 | 6.7806E-05 | 1.7076E-05 | 4.2768E-06 | 1.0697E-06 | |
| order | - | 1.9553 | 1.9894 | 1.9974 | 1.9993 |
| 1/4 | 1/8 | 1/16 | 1/32 | 1/64 | |
|---|---|---|---|---|---|
| 1.5809E-04 | 4.3945E-05 | 1.1415E-05 | 2.8955E-06 | 7.2935E-07 | |
| order | - | 1.8470 | 1.9448 | 1.9790 | 1.9891 |
| 1.5896E-04 | 4.3991E-05 | 1.1418E-05 | 2.8957E-06 | 7.2940E-07 | |
| order | - | 1.8534 | 1.9459 | 1.9793 | 1.9891 |
| 4.9741E-05 | 6.3026E-06 | 7.9008E-07 | 9.8850E-08 | 1.2358E-08 | |
| order | - | 2.9804 | 2.9959 | 2.9987 | 2.9998 |
| 4.9111E-05 | 6.1809E-06 | 7.7336E-07 | 9.6709E-08 | 1.2090E-08 | |
| order | - | 2.9902 | 2.9986 | 2.9994 | 2.9998 |
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 · Solidification and crystal growth phenomena · Advanced Mathematical Modeling in Engineering
On the superconvergence of a hydridizable discontinuous Galerkin method for the Cahn-Hilliard equation
Gang Chen111School of Mathematics Sciences, University of Electronic Science and Technology of China, Chengdu, China. Email: [email protected] , Daozhi Han222 Department of Mathematics and Statistics, Missouri University of Science and Technology. Email: [email protected], John Singler333Department of Mathematics and Statistics, Missouri University of Science and Technology. Email: [email protected]
and Yangwen Zhang444Department of Mathematics Science, University of Delaware Newark, DE. Email: [email protected]
On the superconvergence of a hydridizable discontinuous Galerkin method for the Cahn-Hilliard equation
Gang Chen111School of Mathematics Sciences, University of Electronic Science and Technology of China, Chengdu, China. Email: [email protected] , Daozhi Han222 Department of Mathematics and Statistics, Missouri University of Science and Technology. Email: [email protected], John Singler333Department of Mathematics and Statistics, Missouri University of Science and Technology. Email: [email protected]
and Yangwen Zhang444Department of Mathematics Science, University of Delaware Newark, DE. Email: [email protected]
Abstract
We propose a hydridizable discontinuous Galerkin (HDG) method for solving the Cahn-Hilliard equation. The temporal discretization can be based on either the backward Euler method or the convex-splitting method. We show that the fully discrete scheme admits a unique solution, and we establish optimal convergence rates for all variables in the norm for arbitrary polynomial orders. In terms of the globally coupled degrees of freedom, the scalar variables are superconvergent. Another theoretical contribution of this work is a novel HDG Sobolev inequality that is useful for HDG error analysis of nonlinear problems. Numerical results are reported to confirm the theoretical convergence rates.
Keywords— Cahn-Hilliard equation, hybridizable discontinuous Galerkin method, superconvergence
1 Introduction
Let () be a polygonal domain with Lipshitz boundary and be a positive constant. We consider the following Cahn-Hilliard equation:
[TABLE]
where . The Cahn-Hilliard equation is a fourth order, nonlinear parabolic equation which was originally proposed by Cahn and Hilliard [9, 8, 10] as a phenomenological model for phase separation and coarsening in a binary alloy. Since then Cahn-Hilliard-type equations have found applications in a variety of fields, including multiphase flow [46, 1], two-phase flow in porous media [36], tumor growth [64], pattern formation [65], thin films [6] and many others. Owing to its importance, many works have been devoted to the design and analysis of numerical schemes for solving the Cahn-Hilliard equation; see, e.g., finite difference methods [35], mixed and nonconforming finite element methods [29, 28, 30, 5, 34, 26] and Fourier-spectral methods [59, 44, 58].
In recent years, the discontinuous Galerkin (DG) method has become popular for solving the Cahn-Hilliard equation, owing to its flexibility in handling higher order derivatives, high-order accuracy, the property of local conservation which is crucial for applications in porous redmedium flow and transport phenomenon, high parallelizability and ease of achieving -adaptivity. Applications of DG methods to fourth order elliptic problems have been considered by Babuška and Zlámal in [3], by Baker in [4], and more recently by Mozolevski et al. in a series of works [48, 47, 50, 49, 62]. In [31], Feng and Karakashian design and analyze a DG method of interior penalty type based on the fourth order formulation of the Cahn-Hilliard equation. Optimal error estimates in various energy norms are established: see also [32]. Kay et al. propose and analyze a different DG method [42] that treats the Cahn-Hilliard equation as a system of second order equations allowing a relatively larger penalty term. A fully adaptive version of the interior penalty DG method was recently constructed in [2] for the Cahn-Hilliard equation with a source and optimal error bound were derived; see also [33] for solving the advective Cahn-Hilliard equation. The local discontinuous Galerkin (LDG) method has also been proposed for the discretization of the Cahn-Hilliard equation by writing it as a system of four first-order equations. Dong and Shu in [27] analyzed an LDG scheme for general elliptic equations including the linearized Cahn-Hilliard equation and obtained optimal error estimate in . Recently, an LDG method has been employed for solving a number of Cahn-Hilliard fluid models, cf. [38, 39, 60].
The DG method is however often criticized for the larger amount of degrees of freedom compared to the continuous Galerkin (CG) method . In the seminal work [20] Cockburn et al. propose a hybridizable discontinuous Galerkin (HDG) method for second order elliptic problems. In a nutshell, the HDG method maps the flux and solution into the numerical trace of the solution via a local solver, which are in turn connected by the continuity of fluxes across inter-element boundaries (a transmission condition). Hence the globally coupled degrees of freedom are those numerical traces, resulting in a significant reduction of the number of unknowns in traditional DG methods. Moreover, the HDG methods possess the same favorable properties as classical mixed methods. In particular, HDG methods provide optimal convergence rates for both the gradient and the primal variables of the mixed formulation. This property enables the construction of superconvergent solutions, contrary to other DG methods. These advantages of the HDG methods have made HDG an attractive alternative for solving problems governed by PDEs and PDE control problems, see [24, 21, 25, 23, 11, 55, 54, 18, 56, 61, 13, 40, 37].
Most study currently focuses on establishing optimal and superconvergent rates of HDG methods for second order problems, such as elliptic PDEs [22], convection diffusion equations [16, 17, 52], Stokes equations [25, 21], Oseen equations [11] and Navier-Stokes equations [53, 12]. However, in [19], the authors utilized an HDG method with polynomial degree for all variables to investigate the biharmonic equations and obtained an optimal convergence rate for the solution and suboptimal convergence rates for the other variables. To the best of our knowledge, there does not exist an HDG work that achieves optimal convergence rates for all variables for a fourth order problem.
In this work, we propose a HDG method for the Cahn-Hilliard equation with Lehrenfeld-Schöberl stabilization function, polynomials of degree for the scalar unknown, and polynomials of degree for the other unknowns. The HDG framework with reduced stabilization and polynomials of mixed orders was first introduced by Lehrenfeld in [43] where it was alluded that the scheme could be a superconvergent method, i.e., error estimates is expected for the solution variables even though polynomials of degree are used for the globally coupled unknowns (numerical traces of the solution). Optimal convergence and hence superconvergence was then rigorously established for convection diffusion problems [52], Navier-Stokes equations [53], and more recently for linear elasticity problems [51]. We provide the HDG formulation for the Cahn-Hilliard equation in Section 2 and prove the existence, uniqueness and stability of the HDG method in Section 4. In Section 5, we perform a rigorous error analysis for the HDG method and obtain the following a priori error bounds for the solution , and their fluxes and :
[TABLE]
These convergence rates are further validated by numerical experiments in Section 6. A particular theoretical contribution of this article is the establishment of a novel HDG Sobolev inequality (cf. Theorem 3.14) which is a useful tool in the numerical analysis of nonlinear problems.
2 The HDG formulation
To introduce the fully discrete HDG formulation for the Cahn-Hilliard equation, we first fix some notation. Let be a shape-regular, quasi-uniform triangulation of . Let denote the set of all faces of all simplexes of the triangulation . Also let and denote the set of interior faces and boundary faces, respectively. Furthermore, we introduce the discrete inner products
[TABLE]
For any integer , let denote the set of polynomials of degree at most on the element . We introduce the following discontinuous finite element spaces:
[TABLE]
where is the subspace of of mean zero functions.
Since the HDG method is based on a mixed formulation, we rewrite the Cahn-Hilliard equation as a first order system by setting and in (1). The mixed formulation of (1) then reads
[TABLE]
Now we introduce the fully discrete HDG formulation of the Cahn-Hilliard equation based on backward Euler method and convex-splitting approach.
[TABLE]
We shall also make use of the standard projection, denoted by , onto . Note that coincides with on the space .
To make the expressions concise, we introduce the operator by
[TABLE]
for all .
Then the HDG formulation (3) can be recasted as: for , find , such that
[TABLE]
3 Preliminaries
Throughout, shall denote a generic constant independent of the mesh parameters . We first recall the standard projections and
[TABLE]
which obey the following classical error estimates (see for instance [15, Lemma 3.3]):
[TABLE]
The same error bounds hold true for the projections of and .
We shall also utilize the following version of the piecewise Poincaré-Friedrichs inequality , cf. [7].
Lemma 3.1**.**
Let be a piecewise function with respect to the partition . The following Poincaré-Friedrichs inequality holds
[TABLE]
where the generic constant depends only on the regularity of the partition, and denotes the jump of across a side .
The following HDG Poincaré inequality is then an immediate consequence of Lemma 3.1, the Cauchy-Schwarz inequality and the triangle inequality.
Lemma 3.2** (The HDG Poincaré inequality).**
If , we have
[TABLE]
Now, we glean some basic properties of the operator . First, the definition of in Eq. (4) immediately implies lemmas 3.3 and 3.4.
Lemma 3.3**.**
For any , we have
[TABLE]
Lemma 3.4**.**
For all , the operator has the following property
[TABLE]
Next, we show that the operator satisfies the following bound.
Lemma 3.5**.**
For all , we have
[TABLE]
Proof.
By the definition of in (4) and integration by parts, one gets
[TABLE]
Then the bound (3.5) follows from the Cauchy-Schwarz inequality and the inverse inequality (7b). This completes the proof. ∎
Furthermore, we establish a crucial lemma that bounds the gradient of the scalar variable in terms of the flux variable and the reduced stabilization.
Lemma 3.6**.**
If satisfies
[TABLE]
then the following inequality holds
[TABLE]
Proof.
By the definition of in (4), let in (12) and perform integration by parts to get
[TABLE]
Note that . It follows from the element-wise Cauchy-Schwarz inequality and the inverse inequality (7b) that
[TABLE]
The triangle inequality gives
[TABLE]
The desired inequality (13) now follows by combining the last two inequalities. This completes the proof. ∎
Finally, we show that the operator satisfies a version of the discrete LBB condition.
Lemma 3.7** (Discrete LBB Condition of ).**
For all , we have
[TABLE]
Proof.
We only give the details of the proof of the inequality (14a), since the argument for (14b) is similar.
First, we note that defines a norm in the product space , thanks to the HDG Poincaré inequality (8). Let be a positive number to be specified later. For any fixed , we take to get
[TABLE]
By choosing such that , one obtains
[TABLE]
On the other hand, gives
[TABLE]
Then (14a) follows immediately. This completes the proof.
∎
We now introduce the HDG inversion of the Laplace operator equipped with homogeneous Neumann boundary condition.
Definition 3.8**.**
For any , we define such that
[TABLE]
for all ,
Thanks to the discrete LBB condition Lemma 3.7, the inversion (15) in Definition 3.8 is well defined. For all , we define the semi-norm
[TABLE]
Then for all , by Lemma 3.3 and Definition 3.8, we have
[TABLE]
Next, we show that is a norm on the space .
Lemma 3.9**.**
* defines a norm on the space .*
Proof.
Thanks to (16), one only needs to show that implies for . It follows readily from (16) that
[TABLE]
Then Definition 3.8 and (4) give that for all
[TABLE]
This is only possible if . The proof is complete. ∎
For the negative norm , the following HDG interpolation inequality holds true.
Lemma 3.10**.**
If and , one has
[TABLE]
where is the diameter of the element .
Proof.
Let and . By Definition 3.8 and (4) we have
[TABLE]
By integration by parts, the identity (16) and the inverse inequality (7b) we have
[TABLE]
This concludes our proof. ∎
In addition, by the Definition 3.8, the identity (16) and Lemma 3.6 one can easily establish the following relation.
Lemma 3.11**.**
For any there holds
[TABLE]
For the error analysis of the nonlinear equation we need to establish the discrete HDG Sobolev inequalities for which we will make use of the so-called Oswald interpolation operator [41].
Lemma 3.12** ([41]).**
There exists an interpolation operator, called Oswald interpolation, , such that for any ,
[TABLE]
where denotes the jump of across a side
Remark 3.13*.*
From the proof of [41, Page 644, Theorem 2.1], one can also obtain the following estimate:
[TABLE]
where is any fixed real constant.
Now we are ready to prove the HDG Sobolev inequalities.
Theorem 3.14** (Discrete Sobolev inequalities).**
Let be the exponents as in the classical Sobolev embedding, i.e., satisfying
[TABLE]
For , it holds
[TABLE]
If further , then
[TABLE]
Proof.
We only give the proof of the inequality (23), since (24) is a direct consequence of the inequality (23) and the Poincaré-Friedrichs inequality in Lemma 3.1.
First, we note that the case is trivial since is embedded in by Hölder’s inequality. We consider the case .
By the triangle inequality we have
[TABLE]
Since , by the classical Sobolev embedding, the triangle inequality and Lemma 3.12, we have
[TABLE]
For the term , we use the element-wise Sobolev embedding and the discrete Minkowski’s inequality to get
[TABLE]
where the last inequality follows from the fact and the inequality . Lemma 3.12 then yields
[TABLE]
The desired inequality (23) now follows from the inequalities (25) and (26). This completes the proof.
∎
The combination of the above theorem and the triangle inequality gives the following HDG Sobolev inequality.
Corollary 3.15** (HDG Sobolev inequality).**
For , it holds
[TABLE]
if in addition , then
[TABLE]
where satisfying (22).
Proof.
For any , since is single-valued, by the triangle inequality, we have
[TABLE]
The HDG Sobolev inequality now follows from the inequality (23).
The second inequality (28) follows from the first inequality (27) and the HDG Poincaré inequality (8). This completes the proof. ∎
4 Well-posedness of the HDG formulation
In this section we establish the well-posedness of the HDG method (5), that is, existence and uniqueness of solutions as well as the energy stability of the solutions. The results differ slightly between the fully implicit discretization (FI) and the convex-spliting method (CS): the CS time marching enjoys unconditionally unique solvability and stability while there is a time-step constraint in the FI scheme for uniqueness and stability. For convenience, we will focus on the analysis of one method and point out the difference of the other.
4.1 Existence and uniqueness
Theorem 4.1**.**
The HDG scheme (5) admits at least one solution.
Proof.
We take and in (5) to get
[TABLE]
Introduce the space
[TABLE]
with the inner product
[TABLE]
Thanks to Lemma 3.6 and the HDG Sobolev inequality (3.15), the inner product is well-defined on space with an induced norm . Now we introduce a nonlinear operator as follows
[TABLE]
where . By Lemmas 3.5 and 3.6 and the HDG Sobolev inequality (3.15), the operator is a continuous operator. Therefore,
[TABLE]
By Lemma 3.5, the Cauchy-Schwarz inequality and noting that
[TABLE]
Hence, we have
[TABLE]
Hence for the fixed , if is large enough, we have
[TABLE]
Then [63, II, Lemma 1.4] implies the existence of such that .
Now we define
[TABLE]
with
[TABLE]
We proceed to show that is the solution to the HDG scheme (5).
Since
[TABLE]
and , one gets that
[TABLE]
for all .
Noting that Eqs. (4.1) only hold for . Next, we prove that they are true for the . A direct calculation gives
[TABLE]
Likewise,
[TABLE]
Collectively, (4.1), (32), (4.1) implies
[TABLE]
holds for all . This completes the proof. ∎
Next we show that the solution to the fully discrete scheme with the convex-splitting is unique, while the solution is only conditionally unique for the case of the Backward Euler temporal discretization.
Theorem 4.2**.**
The solution to the HDG scheme of (5) with the splitting is unique. On the other hand, the solution corresponding to the Backward Euler discretization is unique provided that .
Proof.
Given , we let and be two solutions of (5). Let
[TABLE]
After inserting the two solutions into (5), subtracting the two equations gives
[TABLE]
Take to get
[TABLE]
We add the above two equations together to get
[TABLE]
In the case of the convex-splitting , one has
[TABLE]
Hence all terms on the left hand side of (4.1) are nonnegative. It follows that
[TABLE]
Now, we take in (34a) and in (34b) to get , . By (28), Lemma 3.6 and (36), we have .
For the case of the Backward Euler method, i.e., In the case of the convex-splitting , one has
[TABLE]
In light of Eq. (34a) we estimate using the continuity of and Lemma 3.6 as follows
[TABLE]
Hence provided that , Eq. (4.1) yields
[TABLE]
One then obtains uniqueness of the solution for the Backward Euler scheme. This completes the proof. ∎
4.2 Energy stability
In this subsection, we analyze the stability of the HDG formulation (5), focusing on the fully implicit scheme, i.e., . We first recall some useful identities.
Lemma 4.3**.**
Let a,b be two real numbers. Let and be two sequences such that . Then the following identities hold
[TABLE]
The first energy identity makes use of the negative norm and takes the following form.
Lemma 4.4** (Discrete energy identy I).**
Let , be the solution of (5). The following energy identity holds for
[TABLE]
Proof.
Due to the mass conservation property of the scheme, it holds . We take in (5a) to get
[TABLE]
In view of (16), one obtains that
[TABLE]
Next, we take in (5b) to get
[TABLE]
Then we apply to (5b) and take so that
[TABLE]
Taking summation of (39), (40) and (41) gives
[TABLE]
Then multiply this equation by and use the identities in Lemma 4.3 to get
[TABLE]
The identity (38) follows from summing the above equation from to . This completes the proof. ∎
Next, we give the second energy identity which involves the norm of .
Lemma 4.5** (Discrete energy identity II).**
Let , be the solution of (5). Then for , we have the following energy identity
[TABLE]
Proof.
We take in (5a) to get
[TABLE]
Taking the sum of (40), (41) and (43) gives
[TABLE]
The energy identity now follows from applications of the identities in Lemma 4.3 and addition of the resulting equation from to . ∎
There is a negative term, i.e., in the energy identities I and II in the foregoing Lemmas 4.4 and 4.5. In Theorem 4.6, we bound this term and derive the stability result.
Theorem 4.6**.**
Let be the product of the constants in (17) and Lemma 3.6. If the time-step satisfies the constraint , then for , the following energy bounds hold
[TABLE]
Proof.
Since , by the interpolation inequality (17) and Lemma 3.6 we have
[TABLE]
Now, by the energy identity I (38) and the assumption , we have
[TABLE]
The energy bounds (44) now follow from the energy law above, the energy identity II (42) and Lemma 3.6. ∎
Remark 4.7*.*
In the case of the energy-splitting scheme , by the identity (37c), an energy law holds in the spirit of Lemma 4.4 where all terms are associated with the positive sign.
We note that in Theorem 4.6, the energy term is not contained. Moreover, the HDG Poincaré inequality (28) does not apply to since . Hence, we need a refined analysis for this term. In the following we derive further a priori bounds for the solution of the fully implicit HDG scheme (5) with the assumption .
Lemma 4.8**.**
The assumption is the same as in Theorem 4.6. There holds
[TABLE]
where may depend on and the initial condition.
Proof.
Taking in Eq. (5b) yields
[TABLE]
where the last inequality follows from the stability bounds in (44). In light of the stability bounds from (44) and the HDG Poincaré inequality (8), one gets that
[TABLE]
We apply to (5b) and keep (5a) unchanged to get
[TABLE]
Take in (47a) and in (47b) to get
[TABLE]
In light of the symmetry property (10), adding the above two equations together gives
[TABLE]
By the identity (37a) we have
[TABLE]
and hence
[TABLE]
By Hölder’s inequality, we have
[TABLE]
Next, by the HDG Sobolev inequality in Corollary 3.15, we have
[TABLE]
We then use Theorem 4.6 and the Cauchy-Schwarz inequality to get
[TABLE]
Together with (49) and the above inequality, we have
[TABLE]
From the HDG Sobolev embedding inequality Corollary 3.15 again, one gets
[TABLE]
where one uses the estimate (46) and the bounds in Theorem 4.6 in the derivation of the last step. This finishes the proof.
∎
4.3 The uniform estimate of
We now bound in the norm. For this, we introduce the discrete Laplacian operator. For any , we define
such that
[TABLE]
for all . One can verify that is well-defined by the linearity of the operator and the fact that uniqueness implies existence for a linear square system of finite dimension, cf. (4).
Lemma 4.9**.**
Let be the solution of (5). For all , we have
[TABLE]
where depends on and the initial condition.
Proof.
For in Eq. (50), by the uniqueness of the solution, in light of Eq. (5b), one identifies that and . Now taking in (5b), one obtains
[TABLE]
It follows from the Cauchy-Schwarz inequality
[TABLE]
Now, one estimates the term by the HDG Sobolev inequality (27) and the stability bounds in Theorem 4.6 as follows
[TABLE]
One readily obtains the estimate (51) in light of the stability bound(45). This completes the proof. ∎
We now estimate the norm of functions in .
Lemma 4.10**.**
For all , we have the inequality
[TABLE]
Proof.
Consider the following continuous problem: find such that
[TABLE]
Since is convex, we have the regularity estimate
[TABLE]
where . The definitions (50) and (52) imply
[TABLE]
for all . By the uniqueness of solutions to the elliptic projection (59), in view of Remark 5.4, one uses the HDG elliptic projection result (70) to get
[TABLE]
By the triangle inequality, we have
[TABLE]
The are estimated as follows
[TABLE]
where the last inequality follows from the elliptic regularity result. Collecting the above estimates, one concludes the proof.
∎
Using Lemma 4.10 and Lemma 4.9 immediately gives the following result.
Lemma 4.11**.**
Let be the solution of (5). For all , we have
[TABLE]
where depends on and the initial condition.
5 Error analysis
In this section, we provide a convergence analysis of the fully implicit HDG method for the Cahn-Hilliard equation. The convex-splitting scheme can be similarly treated. First, we give our main results. Then, we define an HDG elliptic projection as in [14], which is a crucial step to prove the main result. In the end, we provide rigorous error estimation for our fully implicit HDG method.
Throughout, we assume the data and the solution of (1) are smooth enough. As in Section 4, we do not track the dependence on and treat as if . The generic constant may depend on the data of the problem but is independent of and may change from line to line.
Given , let be the solution of the following system
[TABLE]
If is convex, then we have the following regularity result:
[TABLE]
5.1 The main result
We can now state our main result for the HDG method.
Theorem 5.1**.**
Let and be the solutions of (2) and (5), respectively. Assume the solution attains the maximum regularity for the best approximation results in (7). If for the BE scheme and is arbitrary for the CS scheme, one has the following optimal error estimates
[TABLE]
Furthermore, if the polynomial order , one also has the optimal error estimate in the negative norm
[TABLE]
Remark 5.2*.*
To the best of our knowledge, [19] is the only work for fourth order problems using an HDG method with polynomial degree for all variables. They obtained an optimal convergence rate for the solution and suboptimal convergence rates for the other variables. In contrast, the HDG method proposed in this work deals with a nonlinear fourth order problem and achieves optimal convergence rates for all variables. Moreover, from the view point of degrees of freedom, we obtain the superconvergent rate for the solution.
5.2 The HDG elliptic projection
For all , we define the HDG elliptic projection: find such that
[TABLE]
for all . These projections are well-defined in the sense that there exist unique such that Eqs. (59) hold.
We have the following approximation property for the HDG elliptic projection (59).
Theorem 5.3**.**
Let and be the solution of (2) and (59), respectively. For all integer we have
[TABLE]
Remark 5.4*.*
In the proof of Theorem 5.3 below, we only make use of the regularity of and the fact that . Hence the approximation properties in Theorem 5.3 are valid for any regular functions with .
We only give a proof of (60a) and (60b), and we split the proof into three steps. To simplify the notation, we define
[TABLE]
Note that since for , where is the orthogonal projection onto . The following error estimate of () is classical
[TABLE]
5.2.1 Step 1: The error equation
Lemma 5.5**.**
For all , we have
[TABLE]
Proof.
By the definition of in (4), we have
[TABLE]
where we used the orthogonality of , , in the last equality. Since and , one gets
[TABLE]
This completes the proof. ∎
Subtracting Eq. (63) and Eq. (59b) gives the error equation.
Lemma 5.6**.**
For all , we have
[TABLE]
5.2.2 Step 2: An energy argument
Lemma 5.7**.**
Let and be the solution of (1) and (59b), respectively. The following error estimate holds for and .
[TABLE]
In particular, one has
[TABLE]
Proof.
First, the error equation (64) implies that
[TABLE]
Hence Lemma 3.6 gives
[TABLE]
Noting that by the definitions of and , we now take in (64). Then by the Cauchy-Schwartz inequality, the triangle inequality, the inequality (68) and inequalities in (7), one get
[TABLE]
The error estimate (65) readily follows. Then the estimate (66) is a consequence of the inequality (68).
Now in light of the definitions of the error functions in (61), one obtains the desired error estimate (67) by the triangle inequality, the stability of the projection , the inequalities in (7) and the fact that . This completes the proof. ∎
5.2.3 Step 3: The error estimate of the scalar variable by the duality argument
Similar to Lemma 5.5 we have the following result.
Lemma 5.8**.**
Let be in , and let be the solution to the system (55). Then for all , we have the equation
[TABLE]
Lemma 5.9**.**
Let and be the solutions of (1) and (59b), respectively. Then for , we have the error estimates
[TABLE]
Proof.
We take and in (69) to get
[TABLE]
By Lemma 3.4, the error equation (64), we have
[TABLE]
Since is single valued, one has . Hence
[TABLE]
It follows that
[TABLE]
where the regularity result (56) with is used in the derivation of the last inequality. The rest of the terms can be dealt with similarly by using the stability of the projection , and the inequalities in (7).
The desired error estimate (70) now follows from the error estimates (65) and (66), and the triangle inequality. This completes the proof.
∎
5.3 Error estimate in the negative norm
To establish the approximation properties of the elliptic projection in the negative norm, we introduce a Scott-Zhang type (cf. [57]) interpolation operator \mathcal{I}_{h}^{\color[rgb]{0,0,0}k+2+d} in Section 7. For all , \mathcal{I}_{h}^{\color[rgb]{0,0,0}k+2+d}(u_{h},\widehat{u}_{h})|_{K}\in\mathcal{P}^{\color[rgb]{0,0,0}k+2+d}(K) and satisfies
[TABLE]
Theorem 5.10**.**
Let and be the solution of (1) and (59a)-(59b), respectively. Then if , we have the following error estimates
[TABLE]
Proof.
We only give a proof for (72a), the proof for (72b) is similar.
Let , by Definition 3.8 and (71a) one gets
[TABLE]
We take and \Theta=-\mathcal{I}_{h}^{\color[rgb]{0,0,0}k+2+d}(\Pi_{W}\xi_{h}^{u},\Pi_{M}\xi_{h}^{u}) in (69), and use (73) to get
[TABLE]
Hence
[TABLE]
Since , and by the stability of the interpolation operator (120) one has
[TABLE]
which combining (74), then implies
[TABLE]
This completes the proof. ∎
In a similar fashion as Lemma 4.11 one can establish the stability bound of in the uniform norm.
Lemma 5.11**.**
Let be the solution to the elliptic projection (59b). Assume . Then one has
[TABLE]
where depends on .
5.4 Proof of Theorem 5.1
To simplify notation, we define
[TABLE]
Lemma 5.12**.**
For all , we have the following error equations
[TABLE]
Proof.
We use the definition of in (4) to get
[TABLE]
Next, we have
[TABLE]
This completes the proof. ∎
We start the error analysis in the negative norm. We have
Lemma 5.13** (Error estimates in the norm).**
The following error estimates hold
[TABLE]
Proof.
Taking in (76a) gives
[TABLE]
Lemma 3.4 and Definition 3.8 imply
[TABLE]
Hence
[TABLE]
Next, one takes in (76b) to get
[TABLE]
Combining Eqs. (82) and (83) one obtains
[TABLE]
We first calculate the first term on the left hand side of Eq. (84). Utilizing Definition 3.8 and (4), one has
[TABLE]
On the other hand,
[TABLE]
Hence taking , in (86) yields
[TABLE]
Eq. (5.4) now becomes
[TABLE]
where one has utilized Eq. (16). Substituting (87) into the error equation (84), one has
[TABLE]
The three terms on the right-hand side of Eq. (5.4) are estimated as follows. By Equation 17 and Lemma 3.6 one has
[TABLE]
with an arbitrary positive constant. Likewise, Equation 17 and Lemma 3.11 implies
[TABLE]
where is another free parameter. For the nonlinear term one has
[TABLE]
It follows
[TABLE]
where , and one has utilized the element-wise duality of , the uniform bound in Lemma 5.11, and the stability bounds in Lemma 4.8.
Taking and substituting the inequalities (5.4)–(5.4) back into (5.4), then multiplying the resulting equation by and taking summation from to gives
[TABLE]
Since is an arbitrary positive number, one can choose the maximum of such that . An application of Gronwall’s inequality then gives the error estimate (79). This completes the proof. ∎
Next we derive the error estimates of the scalar variables in the norm.
Lemma 5.14**.**
The scalar variables satisfy the following error bounds
[TABLE]
Proof.
First, we take in (76a) to get
[TABLE]
Next, we take in (76b) to get
[TABLE]
We multiply (94) by and then add (95) to get
[TABLE]
By the stability bound of in Lemma 4.11, we have
[TABLE]
By Lemma 4.3 it follows that
[TABLE]
Apply Cauchy-Schwartz inequality to (96), and then add the resulting equation from to to get
[TABLE]
where one has applied the approximation properties of the elliptic projection in Theorem 5.3. The error estimate in the negative norm (79) implies that
[TABLE]
Hence one has
[TABLE]
This establishes the optimal error estimates of and in the norm.
∎
Finally one performs the error analysis of the flux variables. One has
Lemma 5.15**.**
The scalar variables satisfy the following error bounds
[TABLE]
Proof.
First we take in Eq. (76a) to get
[TABLE]
Applying to Eq. (76b) and then setting in the resulting equation gives
[TABLE]
One now takes in Eq. (76b), and take summation of the result with Eqs. (100)–(101) to obtain
[TABLE]
For , by the Cauchy-Schwartz inequality, the HDG Sobolev inequality Corollary 3.15, Lemma 3.6 and the approximation properties in Theorem 5.3, one obtains
[TABLE]
with a positive number to be chosen later.
Denote by the projection operator onto . By Eq. (76a) with , one has
[TABLE]
where one has utilizes the continuity of the operator in Lemma 3.5, the inverse inequality, the stability of the projections and .
The term is estimated similarly as the term as follows.
[TABLE]
where the uniform bound of in Lemma 5.11 has been applied here.
For one has
[TABLE]
We estimate following the approach in [45]. Choosing , substituting the inequalities (103)–(5.4) back to the Eq. (5.4), multiplying the result by and then taking summation from to implies
[TABLE]
where the last step follows from the error estimate in (98).
By the identity (37d) the last term in (5.4) can be written as
[TABLE]
with . Noting that , the last two terms in (5.4) are non-positive. One has
[TABLE]
Hence by the uniform stability of and in Lemma 4.11 and Lemma 5.11, one obtains
[TABLE]
where one has applied the HDG Sobolev inequality (28) and Lemma 3.6 in deriving the last inequality.
With (5.4) and (5.4), the inequality (5.4) becomes
[TABLE]
By Lemma 4.8 and Theorem 5.3, one has
[TABLE]
An application of the Gronwall’s inequality gives
[TABLE]
This completes the proof. ∎
The combination of (60a), (60d), (60e) and the triangle inequality finishes the proof of Theorem 5.1.
6 Numerical results
We consider two examples on unit square domains in . In the first example we have an explicit solution of the system (1); in the second example an explicit form for the exact solution is not known.
Example 6.1**.**
The problem data and the artificial are chosen so that the exact solution of the system (1) is given by
[TABLE]
We report the errors at the final time for polynomial degrees and in Tables 1 and 2 for the fully implicit scheme and Tables 3 and 4 for the energy-splitting scheme. The observed convergence rates match the theory, where .
7 Appendix
Definition 7.1**.**
[TABLE]
(1) For every vertex on mesh , let be the number of elements adjoint at , and denote all these elements, then \mathcal{I}_{K}^{\color[rgb]{0,0,0}k+1+d} at is defined as
[TABLE]
we note that is a fixed finite number since is shape-regular.
(2) If, in addition, for , for every edge of element , there are interior Lagrange points on edge , for any of these points , let be the number of elements adjoint at , and denote all these elements, then \mathcal{I}_{K}^{\color[rgb]{0,0,0}k+1+d} at is defined as
[TABLE]
Again, is finite since is shape-regular.
(3) Since \mathcal{I}_{K}^{\color[rgb]{0,0,0}k+1+d}(u_{h},\widehat{u}_{h})\in\mathcal{P}^{k+1+d}(K), there are Lagrange points on every face of , the value of \mathcal{I}_{K}^{\color[rgb]{0,0,0}k+1+d}(u_{h},\widehat{u}_{h}) on these points are determined by
[TABLE]
holds for all face of .
(4) Since \mathcal{I}_{K}^{\color[rgb]{0,0,0}k+1+d}(u_{h},\widehat{u}_{h})\in\mathcal{P}^{k+1+d}(K), there are Lagrange points in every element , the value of \mathcal{I}_{K}^{\color[rgb]{0,0,0}k+1+d}(u_{h},\widehat{u}_{h}) on these points are determined by
[TABLE]
It is easy to check that the degrees of freedom of is , the constrains for (111a), (111b), (111c) and (111d) are , , , and . For , there holds
[TABLE]
and for , it holds
[TABLE]
Then the definition of \mathcal{I}_{K}^{\color[rgb]{0,0,0}k+1+d}(u_{h},\widehat{u}_{h}) is a square system, therefore, the uniqueness and the existence of \mathcal{I}_{K}^{\color[rgb]{0,0,0}k+1+d}(u_{h},\widehat{u}_{h}) are equivalence. In addition, it is obviously that when we have \mathcal{I}_{K}^{\color[rgb]{0,0,0}k+1+d}(u_{h},\widehat{u}_{h})=0, then the operator \mathcal{I}_{K}^{\color[rgb]{0,0,0}k+1+d} is well-defined. We define \mathcal{I}_{h}^{\color[rgb]{0,0,0}k+1+d}|_{K}=\mathcal{I}_{K}^{\color[rgb]{0,0,0}k+1+d}, if for all , we have \mathcal{I}_{h}^{\color[rgb]{0,0,0}k+1+d}(u_{h},\widehat{u}_{h}) is unique defined at every face of due to (111a), (111b), and (111c). Then \mathcal{I}_{h}^{\color[rgb]{0,0,0}k+1+d}(u_{h},\widehat{u}_{h})\in H^{1}(\Omega).
Lemma 7.2**.**
For all , we have the stability:
[TABLE]
where is the set of all the simplex such that and has at least one common node, and is the set of all the faces of those simplex.
Proof.
To simplify the proof, we only give a proof for , the proof of is similar. According to (111), we divide the Lagrange points on of degree into 4 parts, and the corresponding Lagrange basis denoted as , , , and , which are determined by (1)(2)(3)(4) in (111), respectively. It is known that , since the corresponding Lagrange points are inside . We also denote the dual basis of and as and , respectively, such that
[TABLE]
where is the Kronecker delta.
A result in show that
[TABLE]
We can write \mathcal{I}_{K}^{\color[rgb]{0,0,0}k+1+d}(u_{h},\widehat{u}_{h}) as
[TABLE]
where
[TABLE]
By a scaling argument, one can get
[TABLE]
Again, by a scaling argument, for the Lagrange point on a face , and is also the vertex of , one can get
[TABLE]
and the similar for , for the Lagrange point on an edge , :
[TABLE]
We use (114c), (116), (117), (112), (115a), (116), (117) and a scaling argument, to get
[TABLE]
We use (114d), (116), (117), (7), (112), (115a), (116), (117) and a scaling argument, to get
[TABLE]
Then desired result is followed by (113), (116), (117), (7), (7) and (115a) with . ∎
Finally, we have the following estimation
Lemma 7.3**.**
For all , we have
[TABLE]
Proof of Lemma 7.3.
Since \mathcal{I}_{h}^{\color[rgb]{0,0,0}k+2+d}(u_{h},u_{h})=u_{h} for every , then (120a) follows from Lemma 7.2 and the fact that \mathcal{I}_{h}^{\color[rgb]{0,0,0}k+2+d} is linear. Then (120b) follows by an application of the inverse inequality. This completes the proof. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] D. M. Anderson, G. B. Mc Fadden, and A. A. Wheeler. Diffuse-interface methods in fluid mechanics. In Annual review of fluid mechanics, Vol. 30 , volume 30 of Annu. Rev. Fluid Mech. , pages 139–165. Annual Reviews, Palo Alto, CA, 1998.
- 2[2] Andreas C. Aristotelous, Ohannes A. Karakashian, and Steven M. Wise. Adaptive, second-order in time, primitive-variable discontinuous Galerkin schemes for a Cahn-Hilliard equation with a mass source. IMA J. Numer. Anal. , 35(3):1167–1198, 2015.
- 3[3] Ivo Babuška and Miloš Zlámal. Nonconforming elements in the finite element method with penalty. SIAM J. Numer. Anal. , 10:863–875, 1973.
- 4[4] Garth A. Baker. Finite element methods for elliptic equations using nonconforming elements. Math. Comp. , 31(137):45–59, 1977.
- 5[5] John W. Barrett, James F. Blowey, and Harald Garcke. Finite element approximation of the Cahn-Hilliard equation with degenerate mobility. SIAM J. Numer. Anal. , 37(1):286–318, 1999.
- 6[6] A. L. Bertozzi and M. Pugh. The lubrication approximation for thin viscous films: regularity and long-time behavior of weak solutions. Comm. Pure Appl. Math. , 49(2):85–123, 1996.
- 7[7] Susanne C. Brenner. Poincaré-Friedrichs inequalities for piecewise H 1 superscript 𝐻 1 H^{1} functions. SIAM J. Numer. Anal. , 41(1):306–324, 2003.
- 8[8] J. W. Cahn. Free Energy of a Nonuniform System. II. Thermodynamic Basis. Journal of Chemical Physics , 30(5):1121–1124, 1959.
