Abstract
In this article, we present a second-order in time implicit–explicit (IMEX) local discontinuous Galerkin (LDG) method for computing the Cahn–Hilliard equation, which describes the phase separation phenomenon. It is well-known that the Cahn–Hilliard equation has a nonlinear stability property, i.e., the free-energy functional decreases with respect to time. The discretized Cahn–Hilliard system modeled by the IMEX LDG method can inherit the nonlinear stability of the continuous model. We apply a stabilization technique and prove unconditional energy stability of our scheme. Numerical experiments are performed to validate the analysis. Computational efficiency can be significantly enhanced by using this IMEX LDG method with a large time step.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
The Cahn–Hilliard equation was originally introduced as a phenomenological model of phase separation in a binary alloy [6], which has been applied to a wide range of problems. It is given by
Here, \(u_{0}(x)\) is a given function and \(\varOmega \subset \mathfrak {R}^{d}\) (\(d=1, 2, 3\)) is a bounded domain. We only focus on \(\mathfrak {R}^{2}\) in this paper. Also, for easy presentation of the analysis, we assume a box geometry and a periodic boundary condition for \(u(\cdot ,t)\), however the method as well as the analysis can be generalized to Dirichlet boundary condition as well. The parameter \(\varepsilon \) is a positive constant and usually represents (the effect of) the interfacial energy in a phase separation phenomenon, which is small compared to the characteristic length of the laboratory scale [6]. The reaction term \(f(u)=F'(u)\), with \(F(u)=\frac{1}{4}(u^{2}-1)^{2}\) being a given energy potential, drives the solution to the two pure states \(u=\pm 1\).
Let the total free energy E(u) be defined by
It is well known that the solution u(x, t) of the Cahn–Hilliard equation possesses the property that the total free energy E(u) decreases with respect to time, as the Cahn–Hilliard equation is the \(H^{-1}\)-gradient flow of the total free energy E(u) [6, 18]. We differentiate the energy E(u) and get
Therefore, the total energy is non-increasing in time and is a Lyapunov functional for the solution of the Cahn–Hilliard equation.
Designing numerical schemes that satisfy the energy-decay property at the discrete level has been extensively studied in the past. There have been many works [9, 11,12,13, 16, 21,22,23], and the references therein, on numerical analysis of the Cahn–Hilliard equation. Most of the analyses are based on finite element methods, finite difference methods or Fourier-spectral methods.
Finite element methods were first presented for the equation by Elliott et al. in [11, 12]. In [7], a conservative nonlinear finite difference scheme was proposed, which was unconditionally stable in the \(L^{\infty }\)-norm and conserved the total mass. However, the energy stability was not discussed. A linearized finite difference method was derived in [23]. Solvability and convergence were studied, but the stability was conditional. In [9], Furihata proposed a conservative difference method for solving the one-dimensional Cahn–Hilliard equation and proved the unconditional stability in the sense of energy decay.
Since the simulation of the Cahn–Hilliard equation needs very long time to reach the steady state, methods allowing large time steps are needed. In [18], a large time-stepping method was proposed for the Cahn–Hilliard equation. The time step can be increased by adding a linear term dependent on the unknown numerical solution. The same large time-stepping method was applied to the epitaxial growth models in [24]. In [20] and [27], adaptive time-stepping methods for the molecular beam epitaxy models and the Cahn–Hilliard equation were presented, respectively. The adaptive time step is selected based on the energy variation or the change of the roughness of the solution.
Later on, Shen and Yang [21] considered a few temporal discretization schemes for the Allen–Cahn and Cahn–Hilliard equations, such as the first-order semi-implicit and the second-order implicit schemes. They also showed energy stability under reasonable conditions and established error estimates for two fully discretized schemes with a spatial spectral-Galerkin approximation. Recently, Li and Qiao in [19] proposed a second-order semi-implicit Fourier spectral method for solving 2D Cahn–Hilliard equations. They introduced a new stabilization technique and proved the property of a decreasing total energy for the discrete scheme with a stabilization depending only on the initial value and the parameter \(\varepsilon \). In this paper, we extend this new technique to the local discontinuous Galerkin method (LDG). This extension is non-trivial, as several discrete operators, such as an inverse Laplacian operator and a discrete Laplacian operator, as well as several properties, such as a broken version of the Brezis–Gallouet inequality, must be defined and analyzed for the LDG spatial discretization.
The LDG method was introduced by Cockburn and Shu in [8] as a generalization of the discontinuous Galerkin (DG) method proposed by Bassi and Rebay in [4]. The LDG method can be applied to PDEs containing higher order spatial derivatives, and the idea is to rewrite the equations with higher order derivatives as a first order system, then apply the DG method to the system with suitable numerical fluxes. For a detailed description about the LDG methods for high order time-dependent PDEs, we refer the readers to the review paper [25]. The LDG method possesses several properties which makes it very attractive for practical computations. For example, the method uses discontinuous-in-space approximations, is locally conservative, which is a crucial property in applications for porous media flows, transport phenomena, etc. From the computational point of view, since no inter-element continuity is imposed, the method can be defined on very general meshes including those with hanging nodes.
The LDG method for the spatial variables is usually combined with fully implicit time-discretization to avoid excessive restriction on the time steps. However, fully implicit schemes may be more difficult in efficient implementation, especially for the fully nonlinear Cahn–Hilliard equation. This is because such schemes require the solution of a coupled system of nonlinear equations per time step, making it computationally challenging to achieve it efficiently. Meanwhile, explicit methods have a strong restriction to the time steps. The small positive parameter \(\varepsilon \) and the nonlinear term of the Cahn–Hilliard equation make most of the finite difference methods to use time-step size of many orders of magnitude smaller than the spatial mesh size. Developing novel numerical techniques for this equation to overcome this difficulty has been extensively studied in the past, e.g., Eyre developed a convex-splitting method and proved that the method is unconditionally gradient stable [14, 15]. Guo and Xu [17] proposed efficient solvers of DG methods for the Cahn–Hilliard equation. Besides, it is known that implicit–explicit (IMEX) techniques have been introduced for time dependent partial-differential equations and can often play an important role in enhancing stability and efficiency [2, 3]. The IMEX schemes usually have large stability regions than other schemes over a wide parameter range. With this motivation, the implicit–explicit strategy is developed for the Cahn–Hilliard equation in this paper. In order to alleviate the stringent time-step restriction of explicit time discretization, we consider a class of implicit–explicit time discretization which treats the nonlinear terms explicitly and the linear terms implicitly. The spatial discretization is the standard local discontinuous Galerkin method. We perform an energy stability analysis on this fully discrete scheme.
The rest of the paper is organized as follows. In Sect. 2, we present some preliminaries and notations, which will be used in the whole paper. In this section, the IMEX LDG method is introduced, and the main theorem is given. In Sect. 3, we discuss two discrete operators and some auxiliary results. In Sect. 4, we prove the unconditional energy stability of the IMEX LDG scheme. In Sect. 5, a few numerical experiments are carried out to confirm the theoretical results and to demonstrate the good performance of this method for the Cahn–Hilliard equation. Finally, some comments and conclusions are made in Sect. 6. A few technical proofs are given in the “Appendix”.
2 The IMEX LDG Methods for the Cahn–Hilliard Equation
2.1 Notations
In this section, we first introduce some notations, which will be used throughout the paper. We use \(H^m({\varOmega })\) and \(\Vert \cdot \Vert _m\) to denote the standard Sobolev spaces and their norms, respectively. In particular, the norm and inner product of \(L^2({\varOmega }) = H^0({\varOmega })\) are denoted by \(\Vert \cdot \Vert \) and \((\cdot , \cdot )\) respectively.
Throughout the paper C will denote a generic positive constant, independent of the discretization parameters, whose value may change from line to line.
Let \(T_h=\{K\}\) be a quasi-uniform partition of the domain \({\varOmega }\) and set \(\partial T_h:=\{\partial K:K\in T_h \}\). For example, in the one-dimensional case, K is a subinterval; in the two-dimensional case, K is a shape-regular triangle for triangular meshes, or a shape-regular rectangle for Cartesian meshes. We will only consider up to two dimensions in this paper.
Associated with this mesh, we define the discontinuous finite element space
where \(P_k(K)\) denotes the space of polynomials in K of degree at most \(k\ge 0\). Now we give the trace inequality with respect to the finite element space. For any function \(v\in V_h\), there exists a positive inverse constant \(\mu >0\) independent of v, h and K such that
Note that functions in \(V_h\) and \({\varPhi }_h\) are allowed to have discontinuities across element interfaces. At each element interface, for any function v, there are two traces along the right-hand and left-hand sides. In the one-dimension case, we define
In the multi-dimension case, let e be an interior face shared by the elements \(K_1\) and \(K_2\), and define the unit normal vectors \(\mathbf {n}_1\) and \(\mathbf {n}_2\) on e pointing exterior to \(K_1\) and \(K_2\), respectively, i.e. \(\mathbf {n}_1=-\mathbf {n}_2\) . We define the edge-jump and edge-average of \(v\in V_h\) by
where \(v_{i}=v|_{\partial K_i}\). Similarly, for a vector-valued function \(\mathbf w \in {\varPhi }_h\), with an analogous definition of \(v_{i}\), \(i=1,2\),
Let \(e_0\) be a fixed nonzero vector, we define
where \(\gamma \) is chosen by \(\gamma \cdot \mathbf {n}=\frac{1}{2}\mathbf {sign}\big (e_0\cdot \mathbf {n}\big ).\)
2.2 The Implicit–Explicit LDG Methods
We start with the Cahn–Hilliard equation, and rewrite (1) as a first order system,
where \(u,\mathbf s _1, \mathbf s _2, p,\mathbf w ,r\) are the auxiliary functions on \({\varOmega }\).
We now consider the following second order in time implicit–explicit scheme,
where \(\Delta t>0\) denotes the time step, and A is a positive constant. The above scheme combines second-order backward differentiation for the time derivative term with a second order extrapolation for the nonlinear term. The stabilization term \(A\Delta t \, (u^{n+1}-u^n)\) is added to enhance stability. Unfortunately, the parameter A must be chosen large enough to ensure stability, according to the analysis below and numerical experiments in Sect. 5.
In order to define the implicit–explicit (IMEX) LDG method to the Eq. (6), we still use \(u^{n+1}, \mathbf s _1^{n}, \mathbf s _2^{n+1}, p^{n+1},\, \mathbf w ^{n+1}, r^{n}\) to denote the numerical solutions. The IMEX LDG scheme is defined by an approximation
such that, \(\forall \rho , \mathbf q , \phi , \psi , \xi \in V_h\times {\varPhi }_h\times V_h\times {\varPhi }_h\times V_h\) on each \(K\in T_h\),
The hat terms in the equations above at the cell boundary from integration by parts are the so-called “numerical fluxes”, which are functions defined on the edges and should be designed based on different guiding principles for different PDEs to ensure stability. The flux choices affect the stability and the accuracy of the method, as well as properties such as sparsity and symmetry of the stiffness matrix; cf. [1, 8]. As we shall see, different choices for the numerical fluxes will lead to different methods. In this paper, we choose the so-called alternating fluxes introduced in [8], i.e. the numerical fluxes \((\hat{u},\hat{\mathbf{w }})\) are defined on inter-element faces as
By the definition of jump and average, we have
We define \(H_{\partial K}(v,\mathbf w )=<\hat{v}, \mathbf w \cdot \mathbf {n}>_{\partial K}+<v, \hat{\mathbf{w }}\cdot \mathbf {n}>_{\partial K}-<v,\mathbf w \cdot \mathbf {n}>_{\partial K}\) as the numerical entropy flux, and choose the same numerical fluxes \((\hat{v},\hat{\mathbf{w }})\) as the alternating fluxes
Note that we can also choose
Using the definition of the numerical fluxes, we get the following property of the numerical entropy flux \(H_{\partial K}(v,\mathbf {w})\).
Lemma 1
[10] Suppose e is an inter-element face shared by the elements \(K_1\) and \(K_2\); then
for any \(v\in V_h\) and \(\mathbf {w}\in {\varPhi }_h\). Moreover, we have
2.3 The Main Theorem
Considering the above second order in time IMEX LDG method, if we choose a good stabilization term A, we can prove the unconditional energy stability for a modified energy functional. We shall first state the main theorem as follows.
Theorem 1
(Unconditional stability for the IMEX LDG method) Consider the IMEX LDG finite element method (7)–(12) with \(\varepsilon >0\) and \( \Delta t >0\). Assume \(u_0\in H^{4}({\varOmega })\) with mean zero. Denote \(E_0=E(u_0)\) as the initial energy. There exists a constant \(C >0\) depending only on \(E_0\) and \(u_0\), such that if
then
where \(\tilde{E}(u^n)\) is defined for \(n\ge 1\) as a modified energy functional:
where \(\sigma _h^n \) will be defined later.
To obtain this main theorem, let us begin with the introduction of several operators and lemmas.
3 Operators and Auxiliary Results
In this section we introduce some operators and auxiliary results, such as the LDG discrete “inverse Laplacian” operator, the discrete Laplacian operator, and the broken version of the Brezis–Gallouet inequality . They will be used in the energy stability proof later.
3.1 The LDG Discrete “inverse Laplacian” Operator and Its Properties
We would like to introduce the LDG discrete “inverse Laplacian” operator \((-\Delta )^{-1}\) on each \(K\in T_h\). Let \(v=(-\Delta )^{-1}u\), then we have the second-order elliptic boundary value problem
To obtain the LDG discrete “inverse Laplacian” operator \((-\Delta )^{-1}\) on each \(K\in T_h\), we first derive the LDG finite element method for the problem (17). We start with rewriting the above problem as follows:
Using the same triangulation \(T_h\) of \({\varOmega }\) and the discontinuous finite element spaces \(V_h\), \( {\varPhi }_h\), we consider the following weak form: find \(v_h\in V_h\) and \(\sigma _h\in {\varPhi }_h\) such that \(\forall \tau , \eta \in {\varPhi }_h\times V_h\) on each \(K\in T_h\),
where \(\hat{\sigma }_h=\sigma _h^-,\,\,\hat{v}_h=v_h^+\).
We need the important lemma in [26] (Lemma 3.1), which illustrates a relationship between the gradient and the element interface jump of the numerical solution with the numerical solution of the gradient.
Lemma 2
[26] Suppose \((v_h, \sigma _h)\) is the solution of (20), then there exists a positive constant \(C_\mu \) independent of h but dependent on the inverse constant \(\mu \), such that
where \(\Vert \cdot \Vert =\Big (\sum \limits _{K}\Vert \cdot \Vert _K^2\Big )^{\frac{1}{2}}\), \(\Vert \cdot \Vert _{\partial T_h}=\Big (\sum \limits _{e\in _{\partial T_h}}\Vert \cdot \Vert _e^2\Big )^{\frac{1}{2}}.\)
Using the above important relationship, we have the following proposition.
Proposition 1
(The existence and uniqueness) Consider the LDG method defined by the weak form (19) and (20), with the numerical fluxes defined by \(\hat{\sigma }_h=\sigma _h^-,\,\,\,\hat{v}_h=v_h^+\). It defines a unique approximate solution \(v_h=(-\Delta )^{-1}u\) in \(V_h^0=\{v\in V_h, \int _{{\varOmega }} vdx=0\}\).
The proof of Proposition 1 is presented in “Appendix A”.
If we let \(u=u^{n+1}-u^{n}\in V_h\) and \(u=u^{n}-u^{n-1}\in V_h\) in Eq. (19) respectively, we can have
and
Using the above LDG discrete “inverse Laplacian” operator \((-\Delta )^{-1}\), we should have \(v_h^{n+1}=(-\Delta )^{-1}\big (u^{n+1}-u^{n}\big )\) and \(v_h^{n}=(-\Delta )^{-1}\big (u^{n}-u^{n-1}\big )\) . So we can obtain the following lemma.
Lemma 3
Suppose \(\Big (v_h^{n+1}, \sigma _h^{n+1}\Big )\) and \(\Big (v_h^n, \sigma _h^{n}\Big )\) are the solutions of (22) and (23) respectively, we have
where \(\delta ^2 u^{n+1}=u^{n+1}-2u^n+u^{n-1}\).
For clarity, we leave the proof of this lemma to “Appendix B”.
3.2 The LDG Discrete Laplacian Operator
For the second-order elliptic problem with a periodic boundary condition
where f is a given function in \(L^2({\varOmega })\), from the above LDG discrete “inverse Laplacian” operator, we can derive the LDG discrete Laplacian operator through its first order version
Multiplying the first and second equations by the test functions \(\tau \) and \(\eta \), respectively, and integrating on a subset K of \(T_h\), we define the LDG “discrete Laplacian” \(\Delta _h\) as follows: given \(u_h \in V_h\), find \(-\Delta _h u_h \in V_h\) such that
where \(\hat{u}_h=u_h^+,\,\,\,\hat{\mathbf {z}}_h=\mathbf {z}_h^-\). The well-posedness of the operator can be obtained in \(V_h^0\).
By the definition of the LDG discrete Laplacian operator, we can rewrite the Eqs. (10) and (11) as
3.3 The Broken Version of the Brezis–Gallouet Inequality
The well known Brezis–Gallouet interpolation inequality is an inequality valid in two dimensions. It shows that a function of two variables which is sufficiently smooth has an explicit bound, which depends only logarithmically on the second derivatives (see [5]):
where C depends only on the domain.
An alternative version of the above inequality is
We can get the following broken version of the Brezis–Gallouet inequality, which will be needed in the next section.
Lemma 4
For any \(u_h\in V_h^0:=\{v\in V_h: (v,1)=0\}\), we have
where \(\mathbf {z}_h\) satisfies
Proof
For \(\forall u_h \in V_h^0\), \(\exists ! \lambda \in V_h^0\), s.t. \(\lambda =-\Delta _h u_h\), i.e.
For \(\lambda \in V_h^0\), \(\exists ! \delta _h=(-\Delta )^{-1}\lambda \), which satisfies (19) and (20), i.e.
This implies that
Taking \(\eta =u_h-\delta _h, \tau =\mathbf {z}_h-\sigma _h\), summing up over K and using the same argument as in Proposition 1, we can get that \(u_h=\delta _h\) in \(V_h^0\).
On the other hand, we define the following adjoint elliptic problem
which is assumed to have the elliptic regularity:
Obviously, \((\delta _h, \sigma _h)\) is the elliptic projection of \((\delta , \sigma )\), and satisfies
Using Lemma in [26] (Lemma 3.2), we have
which yields the result
where the last inequality is due to the elliptic regularity, namely \(\Vert \delta \Vert _2\le C\Vert \lambda \Vert \).
For the estimate of \(h\Vert \lambda \Vert \), taking \(\eta =\lambda \) in (32) and using the inverse property, we can have
Applying the above inequality and Lemma 2, we obtain
\(\square \)
4 The Proof of the Energy Stability
In this section, we will prove the unconditional energy stability for the fully discrete implicit–explicit LDG scheme.
Lemma 5
Consider the IMEX LDG scheme (7)–(12) in Sect. 2, we have
Clearly if
then
Proof
We take the test functions in (7), (8), (9), (10) and (12) as
Using the definition of the LDG discrete “inverse Laplacian” operator \((-\Delta )^{-1}\) in (19) and (20), we have
Now the terms on the right-hand side of Eqs. (36), (37), (38) can be bounded from Eqs. (19), (20). Taking \(\tau =\mathbf s _1^{n}-\mathbf s _2^{n+1}\) and \(\eta =r^{n}-p^{n+1}\),
Subtracting (41) from (36), subtracting the sum of (38) and (42) from (37), and using integration by parts, we obtain
For the Eq. (11), we have
At the same time, we have
Taking \(\psi =\mathbf w ^{n+1}\), then subtracting (46) from (45), we have
Subtracting (44) from (43), then adding to it the sum of (39) and \(\varepsilon ^2\) times the difference of (47) and (40), we have
Summing up over K, with the numerical fluxes at the domain boundary and Lemma 1, we obtain
Noticing \(3u^{n+1}-4u^n+u^{n-1}=2(u^{n+1}-u^{n})+\delta ^2 u^{n+1}\) and using Lemma 3,
where we have applied the simple identity \(a(a-b)=1/2[a^2-b^2+(a-b)^2]\).
For the last nonlinear term, note that
and recalling \(f(u)=F^{\prime }(u)\) , \(F(u)=(u^2-1)^2/4\) and \(f^{\prime }(u)=3u^2-1\),
where \(0<\theta _1<1\).
Because of the convexity of the function \(x^2\), we have
Therefore
Similarly, we have
Collecting the estimates, we obtain
Applying the definition of E(u),
By using the inequality \(2ab\le a^2+b^2\),
From the LDG discrete “inverse Laplacian” and Eqs. (45 ), (46),
Taking \(\psi =\sigma _h^{n+1}\) and \(\eta =u^{n+1}-u^{n}\),
So we have
On the other hand,
Now we have
\(\square \)
We should prove that the energy stability condition (34) is satisfied. The first step is to estimate \(\Vert u^{n+1}\Vert _{\infty }\), then we shall inductively prove that the condition (15) suffices.
4.1 Estimate for \(\Vert u^{n+1}\Vert _{\infty }\)
Lemma 6
Suppose \(\tilde{E}(u^{n})\le M, \tilde{E}(u^{n-1})\le M\) for some \(M\ge 0\) dependent of \(E(u^0)\), (\(n\ge 1\)). Then
where C is independent of \(\Delta t\) and \(\mathbf {w}^{n+1}\) satisfies
Proof
Since \(E(u^{n})\le \tilde{E}(u^{n})\le M\), we have
So that
Similarly
Taking the test functions in (7), (8), (9), (10) and (11) as
we have
Adding the above equations and using Lemma 1,
Reorganizing the above equality,
Summing up over K, we obtain
Obviously,
So we have,
We can get the result \( \Vert u^{n+1}\Vert ^2 \lesssim 1+\varepsilon ^{-2}\) (independent of \(\Delta t\)).
At the same time, we also have
For the estimation of \(\Vert \Delta _h u^{n+1}\Vert \), taking \(\phi =-\Delta _h u^{n+1}\) in (29), we obtain
Then
Finally, for the estimation of \(\Vert \mathbf w ^{n+1}\Vert \), using the Eq. (48) and the boundedness of \(\tilde{E}(u^{n})\) and \(\Vert u^{n+1}\Vert , \Vert u^{n}\Vert , \Vert u^{n-1}\Vert \),
We can apply Lemma 4 to obtain
\(\square \)
4.2 Estimate for the First Step \(u^1\)
In order to start the iteration, we should computer \(u^{1}\) according to the following first-order scheme
So we now have the following lemma
Lemma 7
Consider the above scheme (51), and assume \(u_0\in H^4({\varOmega })\) with mean zero,
where C is independent of \(\Delta t\) and only depends on the initial value.
The proof of this lemma is very similar to Lemma 6. We skip the details at present, but for the completeness of this paper, we put the concise proof in “Appendix C”.
4.3 Proof of Theorem 1
In this proof we shall denote by C a generic constant which depends only on \(u^0\). The value of C may vary from line to line. Let
We shall inductively prove the result for every \(n\ge 1\):
We first check the case \(n=1\). Applying Lemma 6, let \(n=1\), then
We should check the inequality
Using the bound on \(\Vert u^2\Vert _{\infty }\) and \(\Vert u^1\Vert _{\infty }\), we only need to verify that the choice of A in (15) ensures
Let \(\alpha =\frac{1}{\Delta t}+A\Delta t\), then \(\alpha \ge 2\sqrt{A}\). We need
In terms of \(\varepsilon \), we should have the following two cases.
-
1.
\(\varepsilon ^2<1\), we need
$$\begin{aligned} \sqrt{\alpha }\ge C \varepsilon ^{-5}\Big (|\log \varepsilon |+|\log \alpha |\Big ). \end{aligned}$$or
$$\begin{aligned} \alpha \ge C \varepsilon ^{-10}|\log \varepsilon |^2. \end{aligned}$$ -
2.
\(\varepsilon ^2\ge 1\), we need
$$\begin{aligned} \sqrt{\alpha }\ge C \varepsilon ^{-5}\Big (|\log \alpha |\Big ), \end{aligned}$$or
$$\begin{aligned} \alpha \ge C. \end{aligned}$$
From the above two cases, we can deduced the condition of \(\alpha \),
Because \(\alpha \ge 2\sqrt{A}\), the condition on A given in (15) ensures (52). We have \(\tilde{E}(u^2)\le \tilde{E}(u^1)\).
Next, we will check the induction step to prove the inequality \(\tilde{E}(u^{n+1})\le \tilde{E}(u^{n})\). Assume the induction hypothesis hold for all \(1\le \kappa \le n\), \(n\ge 1\). Then for \(n+1\) (\(n\ge 2\)), we only need to check the condition (34), i.e.
By the \(L^\infty \) estimation (50) on \(u^{n+1}, u^{n}\) and \(u^{n-1}\),
Using the same analysis as the case \(n=1\), we can show that the condition on A given in (15) ensures (53). We have now completed the proof of Theorem 1.
5 Numerical Results
In this section, we present some numerical results for the Cahn–Hilliard equation obtained by using the IMEX LDG method, then we verify the orders of accuracy and the energy stability. In Sect. 5.1, we consider the Cahn–Hilliard equation in one spatial dimension, and test the accuracy using an explicitly given exact solution. In Sect. 5.2, the Cahn–Hilliard equation in two spatial dimension is discussed.
5.1 Numerical Results for the Cahn–Hilliard Equation in 1D
In this subsection we discuss the numerical results for the Cahn–Hilliard equation in 1D because there are many benchmark examples and results for this case.
Example 5.1
We consider
with periodic boundary condition. The initial condition is given by
For the spatial discretization, we use \(P^1\) and \(P^2\) elements of the LDG method to approximate (54). The dependency of the numerical solution and the energy stability on the parameter A is demonstrated in Table 1, where “NaN” denotes “not a number”. The result in the table are obtained with \(P^1\) and \(P^2\). They have the same result, so we only list one table. From this table, we can see that the choice of the parameter A is important for the stability, which is consistent with our earlier theoretical analysis. We can also see that the size of A to ensure stability is not as pessimistic as shown in (15) from the analysis. The comparison of the numerical solutions and energy curves obtained by using the IMEX LDG method with different A is given in Fig. 1. We can see that the energy could increase and the numerical solution becomes strange when \(A=0\), and the energy is non-increasing and the solution looks nice when \(A=10^5\).
Example 5.2
Accuracy test for the Cahn–Hilliard equation.
We consider the Cahn–Hilliard equation (54) with \(\varepsilon ^2=1\) in the domain \(x\in [0, 2\pi ]\) and with periodic boundary condition. We test our method taking the exact solution
for the Eq. (54) with a source term , which is a given function so that (56) is an exact solution. We take \(T=1\) , \(A=10\) and list the \(L^2\) errors and numerical orders of accuracy with \(\Delta t=10^{-5}\) for the second-order and third-order LDG methods in Tables 2 and 3 respectively. It is clearly observed that the IMEX LDG methods give the desired spatial order of accuracy.
Furthermore, we test accuracy for the Cahn–Hilliard equation with a smaller \(\varepsilon ^2=0.1\) and a larger \(A=100\) again at \(T=1\). This time, we aim at verifying the second order time accuracy, hence we choose \({\Delta } t =h\) for the second order case and \({\Delta } t =h^{3/2}\) for the third order case, to match the orders of accuracy in space and in time. The results, given in Table 4, again demonstrate the designed order of accuracy.
5.2 Numerical Results for the Cahn–Hilliard Equation in 2D
Now, let us turn our attention to the 2D problem.
Example 5.3
We consider
and the initial condition is
The parameter \(\varepsilon ^{2}\) is again taken as 0.001. \({\varOmega }=[0,1]\times [0,1]\).
From Table 5, we can observe the same results as in 1D, which indicates that the parameter A plays an essential role in the stability property, and also the size of A to ensure stability is not as pessimistic as shown in (15) from the analysis.
Similarly, we verify the numerical order of convergence. A suitable source term is chosen such that
is the exact solution. The physical domain is partitioned with general triangular meshes. In our experiments, the initial mesh is in Fig. 2, and in each refinement, every triangle is subdivided to four children triangles by joining the mid-points of the edges of it, see Fig. 3. Firstly, we compute with polynomial degree 1 or 2 on 32 triangles, then we refine the meshes to compute on 2048 triangles.
We take \(T=1\) , \(A=100\) and list the \(L^{2}\) errors and the numerical orders of accuracy with \(\varepsilon ^{2}=0.1\) in Table 6. The tables show that the errors decrease as the mesh resolution becomes fine, and we can clearly observe optimal orders of spatial accuracy and second-order time accuracy for the 2D Cahn–Hilliard equation on triangular meshes.
6 Conclusion
In this paper, we have developed second-order implicit–explicit local discontinuous Galerkin (LDG) method for the Cahn–Hilliard equation. Unconditional energy stability independent of the time step \(\Delta t\) is proved, when the stabilization parameter A is taken to be sufficiently large but depending only on the initial data and the coefficient \(\varepsilon ^2\). This method can thus achieve substantial improvement in efficiency by using larger time steps. Using the LDG method, we have computed the Cahn–Hilliard equation in 1D and 2D. The numerical results have been presented to demonstrate the stability and approximation accuracy for the IMEX LDG method. One drawback of this method is that the stabilization parameter A has to be chosen sufficiently large in order to ensure unconditional stability. This may adversely affect the accuracy of the scheme, especially for small \(\varepsilon \) (of course, when \(\varepsilon \) is small, the phase transition tends to be sharper and hence the accuracy deteriorates in the rapid transition region anyway). It would be interesting to look for methods which do not rely on such large stabilization parameters, can be implicit only for the linear terms as the method in this paper, and can still have unconditional energy stability.
References
Arnold, D.N., Brezzi, F., Cockburn, B., Marini, L.D.: Unified analysis of discontinuous Galerkin methods for elliptic problems. SIAM J. Numer. Anal. 39, 1749–1779 (2002)
Ascher, U.M., Ruuth, J., Spiteri, R.J.: Implicit–explicit Runge-Kutta method for time dependent partial differential equations. Appl. Numer. Math. 25, 151–167 (1997)
Ascher, U.M., Ruuth, J., Wetton, T.R.: Implicit–explicit method for time dependent partial differential equations. SIAM. J. Numer. Anal. 32, 797–823 (1995)
Bassi, F., Rebay, S.: A high-order accurate discontinuous finite element method for the numerical solution of the compressible Navier–Stokes equations. J. Comput. Phys. 131, 267–279 (1997)
Brezis, H., Gallout, T.: Nonlinear Schrodinger evolution equations. Nonlinear Anal. Theory Meth. Appl. 4, 677–681 (1980)
Cahn, J.W., Hilliard, J.E.: Free energy of a nonuniform system. I. Interfacial free energy. J. Chem. Phys. 28, 258–267 (1958)
Choo, S.M., Chung, S.K., Kim, K.I.: Conservative nonlinear difference scheme for the Cahn–Hilliard equation-II. Comput. Math. Appl. 39, 229–243 (2000)
Cockburn, B., Shu, C.-W.: The local discontinuous Galerkin method for time-dependent convection–diffusion systems. SIAM J. Numer. Anal. 35, 2440–2463 (1998)
Furihata, D.: A stable and conservative finite difference scheme for the Cahn–Hilliard equation. Numer. Math. 87, 675–699 (2001)
Dong, B., Shu, C.-W.: Analysis of a local discontinuous Galerkin method for linear time-dependent fourth-order problems. SIAM J. Numer. Anal. 47, 3240–3268 (2009)
Elliott, C.M., French, D.A.: A nonconforming finite element method for the two-dimensional Cahn–Hilliard equations. SIAM J. Numer. Anal. 26, 884–903 (1989)
Elliott, C.M., Larsson, S.: Error estimates with smooth and nonsmooth data for a finite element method for the Cahn–Hilliard equation. Math. Comput. 58, 603–630 (1992)
Elliott, C.M., Stinner, B.: Computation of two-phase biomembranes with phase dependent material parameters using surface finite elements. Commun. Comput. Phys. 13, 325–360 (2013)
Eyre, D.J.: An unconditionally stable one-step scheme for gradient systems. Available at http://www.math.utah.edu/~eyre/research/methods/stable.ps (1998)
Eyre, D.J.: Unconditionally gradient stable time marching the Cahn–Hilliard equation. Mater. Res. Soc. Sympos. Proc. 529, 39–46 (1998)
Feng, X.L., Song, H., Tang, Tao, Yang, J.: Nonlinear stability of the implicit–explicit methods for the Allen–Cahn equation. Inverse Probl Imaging 7, 679–695 (2013)
Guo, R., Xu, Y.: Efficient solvers of DG discretization for the Cahn–Hilliard equations. SIAM J. Sci. Comput. 58, 380–408 (2014)
He, Y.N., Liu, Y.X., Tang, T.: On large time-stepping methods for the Cahn–Hilliard equation. Appl. Numer. Math. 57, 616–628 (2007)
Li, D., Qiao, Z.: On second order semi-implicit fourier spectral methods for 2D Cahn–Hilliard equations. J. Sci. Comput. 70, 301–341 (2017)
Qiao, Z., Zhang, Z., Tang, T.: An adaptive time-stepping strategy for the molecular beam epitaxy models. SIAM J. Sci. Comput. 33, 1395–1414 (2011)
Shen, J., Yang, X.: Numerical approximations of Allen–Cahn and Cahn–Hilliard equations. Discrete Contin. Dyn. Syst. A 28, 1669–1691 (2010)
Song, H.: Energy stable and large time-stepping methods for the Cahn–Hilliard equation. Inter. J. Comput. Math. 92, 2091–2108 (2015)
Sun, Z.Z.: A second-order accurate linearized difference scheme for the two-dimensional Cahn–Hilliard equation. Math. Comput. 64, 1463–1471 (1995)
Xu, C., Tang, T.: Stability analysis of large time-stepping methods for epitaxial growth models. SIAM J. Num. Anal. 44, 1759–1779 (2006)
Xu, Y., Shu, C.-W.: Local discontinuous Galerkin methods for high-order time-dependent partial differential equations. Commun. Comput. Phys. 7, 1–46 (2016)
Wang, H., Wang, S., Zhang, Q., Shu, C.-W.: Local discontinuous Galerkin methods with implicit–explicit time-marching for multi-dimensional convection–diffusion problems. ESAIM: Math. Model. Numer. Anal. 50, 1083–1105 (2016)
Zhang, Z., Qiao, Z.: An adaptive time-stepping strategy for the Cahn–Hilliard equation. Commun. Comput. Phys. 11, 1261–1278 (2012)
Acknowledgements
We would like to thank the referees for their constructive comments and suggestions which have led to an improvement of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
The first author was supported by NSFC (Grant No.11301167), Natural Science Foundation of Hunan Province, China (Grant No.14JJ3063) and by the China Scholarship Council (CSC). The second author was supported by DOE Grant DE-FG02-08ER25863 and NSF Grant DMS-1418750.
Appendices
Appendix A: The Proof of Proposition 1
Due to the linearity and finite dimensionality of the problem, it is enough to show that the only solution to (19) and (20) with \(u=0\) is \(v_h=0\).
Taking \(\tau =\sigma _h\) and \(\eta =v_h\),
Applying integration by parts, and adding the two equations, we get
Summing over K, we can obtain
which implies \(\sigma _h=0\). Using the relationship (21), we have \(\nabla v_h=0\) on every K and \( [v_h]=0\), since \(\mu >0\). Then \(v_h|_K=C\). Because of \([v_h]=0\), \(v_h=C\). However
which implies \(v_h=0\). Thus we have completed the proof.
Appendix B: The Proof of Lemma 3
Using the LDG discrete “inverse Laplacian” and taking \(\tau =\sigma _h^{n+1}\) and \(\eta =v_h^{n+1}\) in (22),
Then
Summing over K and using the Lemma 1, we can obtain the result (24).
Note that \(\delta ^2 u^{n+1}=u^{n+1}-2u^n+u^{n-1}\), clearly
Similarly, taking \( \eta =v_h^{n+1}\) and \(\tau =\sigma _h^{n+1}-\sigma _h^{n}\),
So that
Summing over K and using the Lemma 1, we can obtain the result (25). This completes the proof.
Appendix C: The Proof of the Lemma 7
Taking \(\rho =\varepsilon ^{2}u^1, \mathbf q =-\varepsilon ^{2}\mathbf {w}^1, \phi =p^1-r^0, {\psi }=\varepsilon ^{2}(\mathbf {s}_1^{0}-\mathbf s _2^1)\) in Eqs. (51), and using the same analysis as the Lemma 6, we have
Summing up over K,
So we have the result
and
By the definition of the discrete Laplacian operator,
Then Taking \(\phi =-\Delta _h u^1\), we obtain
Next, taking \(\rho =v_h^1=(-\Delta )^{-1}(u^1-u^0), \mathbf q =\sigma _h^1, \phi =u^1-u^0,\xi =u^1-u^0\) in Eqs. (51), and
using the same argument as Eqs. (36)–(48), then
Using Lemmas 1, 3, and summing on K,
So that
Finally, by the Lemma 4,
Rights and permissions
About this article
Cite this article
Song, H., Shu, CW. Unconditional Energy Stability Analysis of a Second Order Implicit–Explicit Local Discontinuous Galerkin Method for the Cahn–Hilliard Equation. J Sci Comput 73, 1178–1203 (2017). https://doi.org/10.1007/s10915-017-0497-5
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10915-017-0497-5