An efficient and convergent finite element scheme for Cahn--Hilliard equations with dynamic boundary conditions
Stefan Metzger

TL;DR
This paper introduces an efficient, unconditionally energy-stable finite element scheme for the Cahn--Hilliard equation with dynamic boundary conditions, demonstrating convergence and practical effectiveness through simulations.
Contribution
It proposes a novel finite element method for a recent Cahn--Hilliard model with boundary dynamics, establishing convergence and energy stability.
Findings
Scheme is unconditionally energy stable.
Convergence towards weak solutions is proven.
Numerical simulations confirm practicality and convergence order.
Abstract
The Cahn--Hilliard equation is a widely used model that describes amongst others phase separation processes of binary mixtures or two-phase flows. In the recent years, different types of boundary conditions for the Cahn--Hilliard equation were proposed and analyzed. In this publication, we are concerned with the numerical treatment of a recent model which introduces an additional Cahn--Hilliard type equation on the boundary as closure for the Cahn--Hilliard equation in the domain [C. Liu, H. Wu, Arch. Ration. Mech. An., 2019]. By identifying a mapping between the phase-field parameter and the chemical potential inside of the domain, we are able to postulate an efficient, unconditionally energy stable finite element scheme. Furthermore, we establish the convergence of discrete solutions towards suitable weak solutions of the original model. This serves also as an additional pathway to…
| 0.01 | 0.01 | 2 | 0.01 | 0.02 | 1 | 250 |
| 0.01 | 0.02 | 2 | 0.02 | 0.02 | 1 | 250 |
| - | ||
| 2.3 |
| - | ||
| 2.3 |
| - | ||
| 1.1 |
| - | ||
| 1.6 |
| - | ||
| 1.6 |
| - | ||
| 1.6 |
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.
An efficient and convergent finite element scheme for Cahn–Hilliard equations with dynamic boundary conditions111This work was funded by the NSF through grant number NSF-DMS 1759536.
Stefan Metzger
Department of Applied Mathematics, Illinois Institute of Technology, Chicago IL, 60616, USA
(Date: March 17, 2024)
Abstract.
The Cahn–Hilliard equation is a widely used model that describes amongst others phase separation processes of binary mixtures or two-phase flows. In the recent years, different types of boundary conditions for the Cahn–Hilliard equation were proposed and analyzed. In this publication, we are concerned with the numerical treatment of a recent model which introduces an additional Cahn–Hilliard type equation on the boundary as closure for the Cahn–Hilliard equation in the domain [C. Liu, H. Wu, Arch. Ration. Mech. An., 2019]. By identifying a mapping between the phase-field parameter and the chemical potential inside of the domain, we are able to postulate an efficient, unconditionally energy stable finite element scheme. Furthermore, we establish the convergence of discrete solutions towards suitable weak solutions of the original model. This serves also as an additional pathway to establish existence of weak solutions. Furthermore, we present simulations underlining the practicality of the proposed scheme and investigate its experimental order of convergence.
Key words and phrases:
Cahn–Hilliard, dynamic boundary conditions, finite elements, convergence
2010 Mathematics Subject Classification:
35Q35, 35G31, 65M60, 65M12
1. Introduction
Different approaches to model the hydrodynamics of fluid mixtures have been widely used in literature. In addition to the conventional sharp interface models which consist of separate hydrodynamic systems for each component of the mixture, there are diffuse interface models. In these models, the hyper-surface description of the fluid-fluid interface is replaced by a small transition region, where mixing of the macroscopically immiscible fluids is allowed. This leads to a smooth transition between the pure phases. In this manuscript, we analyze a numerical scheme for a diffuse interface model featuring dynamic boundary conditions, which was derived recently by C. Liu and H. Wu [38]. In an open domain with boundary and outer normal vector , this model reads
[TABLE]
with suitable initial conditions for the phase-field parameter in . Here, denotes the Laplace–Beltrami operator, the positive parameters and are the mobility constants in the domain and on the boundary, the constant is related to the surface tension, describes the influence of surface diffusion, and and prescribe the width of the transition area in the domain and on the boundary. The potentials and which govern the chemical potentials and will be discussed below in more detail. In (1.1), it is assumed that is defined on and that its evolution is governed by a chemical potential defined on and an additional one defined on . In contrast to other approaches (cf. [28]), and are distinct quantities which are only coupled via the normal derivative of .
In the recent years, various different boundary conditions for Cahn–Hilliard equations have been discussed. The easiest form of a diffuse interface model for two-phase flow reads
[TABLE]
in combination with initial conditions for . The chemical potential is given as the first variation of the free energy
[TABLE]
where is a double-well potential with minima in representing the pure fluid phases. Typical choices for are the logarithmic double-well potential
[TABLE]
with , the double obstacle potential
[TABLE]
and the polynomial double-well potential . Cahn–Hilliard equations with polynomial double-well potentials are investigated, e.g. in [20, 58, 46, 5, 29, 49]. For Cahn–Hilliard equations with the singular potentials and , we refer the reader to [7, 18, 1, 13].
The boundary condition (1.2c) states that there is no flux across , i.e. is conserved. The second boundary condition (1.2d) indicates that the fluid-fluid interface, i.e. the zero level set of , intersects the boundary at a static contact angle of . This can be interpreted as neglecting the interactions between the fluids and the walls of the surrounding container. Although (1.2) satisfies the energy balance equation
[TABLE]
the boundary condition (1.2d) imposing a static contact angle is considered a major flaw and there are several attempts to improve this boundary condition. For an improved description of the occurring boundary effects, the surface energy functional
[TABLE]
was introduced with and . Here, denotes the surface gradient operator on and denotes a suitable boundary potential which might be chosen similar to . Dynamic boundary conditions were picked in a way that the total energy is decreasing in time. An example for such boundary conditions are Allen–Cahn-type boundary conditions (cf. [21, 22, 48, 55, 14, 27, 42, 13, 37, 16, 15, 41]), where (1.2d) is replaced by
[TABLE]
In the case and , this boundary conditions reduces to
[TABLE]
where the potential interpolates between the liquid-solid interfacial energies of the two fluid phases and prescribes the stationary contact angle via Young’s formula. This boundary condition was used in [47] to describe dynamic contact angles (see also [52]). Models combining the boundary conditions (1.2c) and (1.8) satisfy an energy equality of the form
[TABLE]
and conserve the mean value of in , i.e. we have \left.\kern-1.2pt\int_{\Omega}\phi\vphantom{\big{|}}\right|_{T}=\left.\kern-1.2pt\int_{\Omega}\phi\vphantom{\big{|}}\right|_{0}.
In [24] a coupled boundary condition replacing (1.2c) and (1.2d) was proposed. Assuming that is the trace of , boundary conditions of the form
[TABLE]
were introduced. A solution to (1.2a), (1.2b), and (1.11) still minimizes in the sense that
[TABLE]
holds true. However, the boundary conditions (1.11) do not allow for conservation of .
A third approach was proposed by Goldstein et al. in [28]. In this publication, it was also assumed that is the trace of . However, (1.11) was replaced by a Cahn–Hilliard-type boundary equations of the form
[TABLE]
Solutions to (1.2a), (1.2b), and (1.13) satisfy the energy equality
[TABLE]
Furthermore, the total mass of is conserved, i.e. . A similar model was also discussed in [43].
A fourth approach was proposed by C. Liu and H. Wu. In [38], they derived model (1.1) via a variational approach using different flow maps for and . This model also satisfies (1.14). However, the underlying assumptions on the occurring boundary effects are different. While the boundary conditions proposed in [28] allow for mass transfer between and and enforce an instant equilibration of the chemical potentials, i.e. has to be the trace of , the model derived in [38] allows for differences in the chemical potentials, but prohibits mass transfer, i.e. and are conserved individually. For boundary conditions interpolating between (1.13) and (1.1c)-(1.1e), which can be interpreted as non-instantaneous adsorption processes, we refer the reader to [34].
A first existence and uniqueness result for weak and strong solutions to (1.1) was provided in [38] by constructing solutions to a regularized system, where (1.1b) and (1.1e) are extended by , and taking the limit .
A different pathway to proving the existence of solutions to (1.1) was used by Garcke and Knopf in [26]. They interpreted model (1.1) as a gradient flow equation to the total free energy and used this structure for their proof of existence and uniqueness of weak solutions. A comparable wellposedness result derived from a fully discrete finite element scheme can be found in Theorem 4.4 of this manuscript.
The numerical treatment of the Cahn–Hilliard equation and its variants – often in combination with Navier–Stokes-equations – was intensely discussed through the last years. Consequently, there are various different discretization techniques at hand, which transfer the energy stability (1.6) to a discrete setting. These techniques include approaches based on convex-concave splittings of the energy (cf. [54, 50]) or the polynomial double-well potential (cf. [19] and [32, 30, 25, 31] for an application of Cahn–Hilliard–Navier–Stokes-systems), stabilized linearly implicit approaches (cf. [56, 51]), the method of invariant energy quadratization (cf. [12, 57]) and the recently developed scalar auxiliary variable approach (see [36]).
Although, we will restrict ourselves to non-singular potentials, we do not want to conceal that there are also numerical schemes at hand which are able to deal with the singular potentials and (see e.g. [17, 8, 6, 3, 4, 23]).
In this publication, we are interested in the numerical treatment of (1.1). A finite difference model for the treatment of the Allen–Cahn-type boundary conditions (1.8) was proposed in [33]. A first finite element scheme for model (1.1) was proposed in the Bachelor’s thesis [53] (see also [26] for numerical results). In this thesis, a straightforward, fully implicit discretization based on continuous, piecewise linear finite element functions was applied to model (1.1), and the arising nonlinear system was solved using Newton’s method. In this publication, we pursue a different approach and investigate the connection between and the chemical potentials.
The peculiarity of (1.1) is the coupling between the chemical potential defined inside of the domain and the on the boundary. In the standard Cahn–Hilliard equation (1.2), the chemical potential is merely a definition in terms of . This allows us to write (1.2) as a sole, nonlinear, fourth-order equation (see e.g. [32, 31, 25]). In (1.1), however, the chemical potentials and are coupled via the normal derivative . Therefore, its weak form formally reads
[TABLE]
with sufficiently regular , , and . In particular, we have only one equation for and . Consequently, the chemical potentials have to be determined by solving a system consisting of (1.15c) and the additional assumption that is continuous on . The latter one translates to the constraint that (1.15a) and (1.15b) yield compatible results. Deducing a suitable expression for will be key ingredient for the derivation of an efficient numerical scheme, but also for the numerical analysis, as the existence of a unique (discrete) for any given allows us to reuse techniques from the analysis of the standard Cahn–Hilliard equations. As we will discuss in Remark 2.5, this approach also prevents the arising linear system from degenerating for vanishing time increments.
The outline of the paper is as follows. In Section 2, we introduce the discrete function spaces and derive the discrete scheme. In Section 3, we will establish a first a priori estimate which is discrete counterpart of (1.14), and use this estimate to prove the existence of discrete solutions. The main convergence result, Theorem 4.4, which also provides the existence of weak solutions, can be found in Section 4, where we establish improved regularity results and show the convergence of discrete solutions towards weak solutions of (1.1). For uniqueness results for these weak solutions, we refer the reader to Section 5 in [26]. We will conclude this section by briefly discussing the case of Allen–Cahn-type boundary conditions (cf. Remark 4.5). By showing that the presented techniques are also applicable for Allen–Cahn-type boundary conditions, we also cover (1.8) and its special case (1.9) suggested in [47]. In Section 5, we present numerical simulations of phase-separation processes to underline the practicality of the scheme. We shall also validate our scheme in terms of mass conservation, energy dissipation, and compatibility of (1.15a) and (1.15b).
Notation
Given the spatial domain with and a time interval , we denote the space-time cylinder by . By we denote the space of -times weakly differentiable functions with weak derivatives in . The symbol stands for the closure of in . For , we will denote by and by . The dual space of will be denoted by and the corresponding dual pairing by . For a Banach space and a time interval , the symbol stands for the parabolic space of -integrable functions on with values in . We use a notation similar to the one introduced above for function spaces defined on . In this publication, we are concerned with domains having a lipschitzian boundary . In this case, the spaces , , and are well-defined (cf. [35]). We denote the dual pairing between and by . In addition, we define the space
[TABLE]
where defines the trace operator. For domains with lipschitzian boundaries, the trace operator is uniquely defined and lies in (cf. [44]). For brevity, we will sometimes (in particular when the considered function is continuous) neglect the trace operator and write instead of .
2. Derivation of an efficient numerical scheme
We start by introducing the general notation and the discretization techniques used in the considered scheme. Concerning the discretization with respect to time, we assume that
- •
the time interval is subdivided in intervals with for time increments and with . For simplicity, we take for .
The spatial domain in spatial dimensions is assumed to be bounded and convex. To avoid additional technicalities, we will asssume that is polygonal (or polyhedral, respectively). We introduce partitions of and of depending on a spatial discretization parameter satisfying the following assumptions:
- •
Let be a quasiuniform family (in the sense of [10]) of partitions of into disjoint, open simplices , so that
[TABLE]
- •
Let be a quasiuniform family of partitions of into disjoint, open simplices , so that
[TABLE]
and
[TABLE]
• ‣ 2 implies that is compatible to in the sense that all elements in are edges (or faces) of elements in . For the approximation of the phase-field and the chemical potential we use continuous, piecewise linear finite element functions on . This space will be denoted by and is spanned by the functions forming a dual basis to the vertices of , i.e. for . Analogously, we denote the space of continuous, piecewise linear finite element functions on by . This space is spanned by functions forming a dual basis to the vertices of , i.e. for . Due to the compatibility condition for and , we have
[TABLE]
Without loss of generality, we may assume that the first vertices of are located on , i.e. . We define the nodal interpolation operators and by
[TABLE]
For future reference, we state the following estimate for the interpolation operators.
Lemma 2.1**.**
Let and satisfy • ‣ 2 and • ‣ 2. Furthermore, let , , and for or for . Then
[TABLE]
holds true for all .
Proof.
Using the standard error estimates for the nodal interpolation operator (cf. [10]), we compute on each :
[TABLE]
As , they are linear on each , i.e. their second spatial derivatives vanish. Therefore, we obtain
[TABLE]
As the first spatial derivatives of and are constant, we combine (2.5) and (2.6) and apply Hölder’s inequality to obtain
[TABLE]
Similar computations provide the result for . ∎
Concerning the potentials and , we make the following assumptions:
- •
are bounded from below, i.e. there exists a constant such that and for all . Furthermore, there exist convex, non-negative functions and concave functions such that and .
- •
The convex and concave parts of and can be further decomposed into a polynomial part of degree four and an additional part with a globally Lipschitz-continuous first derivative. Moreover, there exists such that the concave parts satisfy
[TABLE]
for all . In the case , we assume that the above assumption holds true for .
Remark 2.2**.**
The Assumptions • ‣ 2 and • ‣ 2 are in particular satisfied by the polynomial double-well potential and the penalized double-well potential
[TABLE]
*The latter one is often used in practical computations, as it penalizes but does not introduce singularities (cf. [31]).
The logarithmic potential and the double obstacle potential , which have the advantage of restricting to the interval , do not satisfy • ‣ 2 and • ‣ 2 and are therefore not considered in this manuscript.*
Remark 2.3**.**
In this publication, we consider only a convex-concave decomposition of the double-well potential. Other suitable, energy stable discretization techniques can be found in [31]. For a comparison of these techniques, we refer to [40].
Using the notation introduced above and the compatibility condition (2.1), we may write our discrete scheme as follows: For given , find satisfying
[TABLE]
for all . As discussed on the example of the weak formulation (1.15), (2.9) only provides on equation for both chemical potentials. Consequently, the goal for this section will be to derive an equivalent formulation for (2.9) with unique expressions for and , which allows us to reuse the standard techniques established for (1.2).
We define the lumped mass matrices and via
[TABLE]
Furthermore, we collect the nodal values of , , , and in the vectors , , , and . In a slight misuse of notation, we will write , when we apply a function to all components of . With this notation, we are able to rewrite (2.9) as
[TABLE]
Here, we used the extension operator \left.\kern-1.2pt.\vphantom{\big{|}}\right|^{\Omega}\,:\,\mathds{R}^{\dim U_{h}^{\Gamma}}\rightarrow\mathds{R}^{\dim U_{h}^{\Omega}} defined via
[TABLE]
and the restriction operator \left.\kern-1.2pt.\vphantom{\big{|}}\right|_{\Gamma}\,:\,\mathds{R}^{\dim U_{h}^{\Omega}}\rightarrow\mathds{R}^{\dim U_{h}^{\Gamma}}, which restricts a vector its first entries.
In order to derive a scheme allowing to solve (2.11), we define restriction operators for matrices. In particular, we will split a matrix into submatrices
[TABLE]
such that
[TABLE]
Hence, the chemical potentials are given as solutions of the -system
[TABLE]
[TABLE]
Here, the first two lines are a consequence of (2.11c) and the last line guarantees that (2.11a) and (2.11b) provide the same result for \left.\kern-1.2pt\Phi^{n}\vphantom{\big{|}}\right|_{\Gamma}.
As the (2.11) is nonlinear in , computing a possible solution requires the application of an iterative scheme (e.g. Newton’s method) and therefore solving (2.15) multiple times per time step. Hence, solving a -system each time is not desirable and we have to continue reducing the complexity of the system.
From the second line in (2.15), we immediately get
[TABLE]
while the first line provides
[TABLE]
Using (2.17) and (2.18), we may write the last line in (2.15) as
[TABLE]
and therefore
[TABLE]
As is a diagonal matrix, \left.\kern-1.2pt\mathbf{M}_{\Omega}^{-1}\vphantom{\big{|}}\right|_{\Gamma\times\Omega}\left.\kern-1.2pt\mathbf{L}_{\Omega}\vphantom{\big{|}}\right|_{\Omega\times\Gamma}=\left.\kern-1.2pt\mathbf{M}_{\Omega}^{-1}\vphantom{\big{|}}\right|_{\Gamma\times\Gamma}\left.\kern-1.2pt\mathbf{L}_{\Omega}\vphantom{\big{|}}\right|_{\Gamma\times\Gamma} holds true. This allows us to multiply (2.20) by \left.\kern-1.2pt\mathbf{M}_{\Omega}\vphantom{\big{|}}\right|_{\Gamma\times\Gamma} to obtain
[TABLE]
In order to show that (2.21) provides a well-defined expression for \left.\kern-1.2ptP^{n}\vphantom{\big{|}}\right|_{\Gamma}, we need to prove that the matrix on the left-hand side is indeed invertible.
Lemma 2.4**.**
The matrix {\left(m\left.\kern-1.2pt\mathbf{L}_{\Omega}\vphantom{\big{|}}\right|_{\Gamma\times\Gamma}+m_{\Gamma}\left.\kern-1.2pt\mathbf{M}_{\Omega}\vphantom{\big{|}}\right|_{\Gamma\times\Gamma}\mathbf{M}_{\Gamma}^{-1}\mathbf{L}_{\Gamma}\mathbf{M}_{\Gamma}^{-1}\left.\kern-1.2pt\mathbf{M}_{\Omega}\vphantom{\big{|}}\right|_{\Gamma\times\Gamma}\right)}, that is defined via (2.10) and (2.13), is symmetric, positive definite.
Proof.
It is obvious that m\left.\kern-1.2pt\mathbf{L}_{\Omega}\vphantom{\big{|}}\right|_{\Gamma\times\Gamma} and m_{\Gamma}\left.\kern-1.2pt\mathbf{M}_{\Omega}\vphantom{\big{|}}\right|_{\Gamma\times\Gamma}\mathbf{M}_{\Gamma}^{-1}\mathbf{L}_{\Gamma}\mathbf{M}_{\Gamma}^{-1}\left.\kern-1.2pt\mathbf{M}_{\Omega}\vphantom{\big{|}}\right|_{\Gamma\times\Gamma} are symmetric, positive semi-definite matrices. Therefore, it will be sufficient to show that A^{T}\left.\kern-1.2pt\mathbf{L}_{\Omega}\vphantom{\big{|}}\right|_{\Gamma\times\Gamma}A>0 for all to complete the proof. This is equivalent to showing
[TABLE]
From (2.10), we have that is symmetric, positive semi-definite with only constant vectors corresponding to the zero eigenvalue. As the restrictions in (2.22) do not allow for constant vectors, the proof is complete. ∎
Combining (2.21) with (2.17), we obtain an expression for the chemical potential which requires us to solve only a by linear system with a sparse, symmetric, positive definite matrix. Having an expression for the chemical potential, we propose the following nonlinear equation for . For given , we compute satisfying
[TABLE]
Here, and , which are defined in (2.16), also depend on the known values . As we will show in the next section, solutions to (2.23) satisfy the compatibility condition used in (2.15), which allows us to recover (2.9).
Remark 2.5**.**
*At this point, we want to discuss the advantages of formulation (2.23). Although (2.9) can be written in a symmetric form, trying to solve (2.9) directly has one major flaw. As there is no explicit formula for the chemical potentials available, one has to solve for , , and monolithically. However, this system degenerates for , i.e. if we opt for a small time increment to capture rapid changes, we end up with an ill-conditioned system: For , (2.9a) and (2.9b) reduce to , i.e. the dependencies on the chemical potentials vanishe leaving only (2.9c) to determine both potentials.
The proposed scheme (2.23), on the other hand, is based on another -independent relation between the chemical potentials, which prevents the system from becoming ill-conditioned for vanishing time increments. For an illustration of the dependence of the condition numbers on the size of the time increment based on practical computations, we refer the reader to Section 5.
The downside of (2.23) is that it requires us to solve an additional smaller linear system with the matrix {\left(m\left.\kern-1.2pt\mathbf{L}_{\Omega}\vphantom{\big{|}}\right|_{\Gamma\times\Gamma}+m_{\Gamma}\left.\kern-1.2pt\mathbf{M}_{\Omega}\vphantom{\big{|}}\right|_{\Gamma\times\Gamma}\mathbf{M}_{\Gamma}^{-1}\mathbf{L}_{\Gamma}\mathbf{M}_{\Gamma}^{-1}\left.\kern-1.2pt\mathbf{M}_{\Omega}\vphantom{\big{|}}\right|_{\Gamma\times\Gamma}\right)} repeatedly. However, as this matrix is symmetric and positive definite, it can be tackled efficiently using a conjugate gradient method.*
3. Stability and existence of discrete solutions
In this section, we analyze the discrete scheme (2.23) proposed in the previous section. As we derived explicit expressions for and in the previous section, we could return to the variational form (2.9) and derive stability and existence results from there. Namely, testing (2.9a) by , (2.9b) by , and (2.9c) by will provide a discrete version of (1.14). However, as (2.23) is the formulation we suggest to implement, we establish first stability and existence results based on this formulation. By doing so, we shall verify that all information from (2.9) are preserved in (2.23) and shed light on the structure of (2.23).
Although (2.23) is entirely written in terms of the unknown quantity , we will continue using and , which are defined in (2.21), (2.17), and (2.18), to simplify the notation. For the ease of representation, we will set for the remainder of this publication. As a first step, we shall verify that (2.23) indeed satisfies the compatibility constraint m\left.\kern-1.2pt\mathbf{M}_{\Omega}^{-1}\vphantom{\big{|}}\right|_{\Gamma\times\Gamma}\left.\kern-1.2pt\mathbf{L}_{\Omega}\vphantom{\big{|}}\right|_{\Gamma\times\Omega}P^{n}=m_{\Gamma}\mathbf{M}_{\Gamma}^{-1}\mathbf{L}_{\Gamma}P_{\Gamma}^{n}. This auxiliary result allows us derive an a priori stability result for (2.23) which serves as the corner stone for proving the existence of discrete solutions without additional restrictions on or .
Lemma 3.1**.**
Let and be defined via (2.21), (2.17), and (2.18). Then the identity
[TABLE]
holds true.
Proof.
Using (2.17), we compute
[TABLE]
Recalling (2.21) and (2.18), we obtain
[TABLE]
which completes the proof. ∎
This result allows us to show that the phasefield parameter is conserved in and on . Multiplying (2.23) by and by \left.\kern-1.2pt\boldsymbol{1}_{\Gamma}^{T}\mathbf{M}_{\Gamma}\vphantom{\big{|}}\right|^{\Omega} proves the following corollary.
Corollary 3.2**.**
Let be a discrete solution of (2.23). Then
[TABLE]
with and \boldsymbol{1}_{\Gamma}:=\left.\kern-1.2pt\boldsymbol{1}\vphantom{\big{|}}\right|_{\Gamma}.
Using the above auxiliary results, we are now able to state a first stability result which is a discrete version of the energy equality (1.14).
Lemma 3.3**.**
Let the assumptions • ‣ 2, • ‣ 2, • ‣ 2, • ‣ 2, and • ‣ 2 hold true and let be given. Then a solution to (2.23), if it exists, satifies
[TABLE]
with , \boldsymbol{1}_{\Gamma}:=\left.\kern-1.2pt\boldsymbol{1}\vphantom{\big{|}}\right|_{\Gamma}, and and defined in (2.17), (2.21), and (2.18).
Proof.
We multiply (2.23) by and use Lemma 3.1 to obtain
[TABLE]
As and provide the dissipative parts of the desired estimate, we have show to that and yield the time difference of the energy. Recalling (2.18), we compute
[TABLE]
Consequently, we obtain from (2.21)
[TABLE]
As and are diagonal matrices, we may combine and , and {(G^{\prime}_{+}{(\left.\kern-1.2pt\Phi^{n}\vphantom{\big{|}}\right|_{\Gamma})}+G^{\prime}_{-}{(\left.\kern-1.2pt\Phi^{n-1}\vphantom{\big{|}}\right|_{\Gamma})})} and \left.\kern-1.2pt{(\Phi^{n}-\Phi^{n-1})}\vphantom{\big{|}}\right|_{\Gamma} componentwise. In combination with , this provides the result. ∎
Using the a priori estimate from Lemma 3.3, we are able to prove the existence of discrete solutions.
Lemma 3.4**.**
Let the assumptions • ‣ 2, • ‣ 2, • ‣ 2, and • ‣ 2 hold true and let be given. Then, there exists at least one vector solving (2.23).
Proof.
We will prove the existence of discrete solutions by contradiction. Let denote the discrete -norm which is derived from the inner product . According to Corollary 3.2, the mean-value of the phase-field is conserved in . This allows us to assume w.l.o.g. that . Therefore, is also a norm of . Under the assumption that (2.23) has no solution in
[TABLE]
for any , the function defined via
[TABLE]
has no root and is continuous on . This allows us to define a function as
[TABLE]
As is continuous and maps a closed set onto itself, Brouwer’s fixed point theorem provides the existence of at least one fixed point . In the following, we will show
[TABLE]
for a suitable and large enough. This contradiction shows that the initial assumption of (2.23) not having solutions in is wrong. To prove the contradiction (3.9), we choose with
[TABLE]
and
[TABLE]
i.e. the test vector is the sum of the chemical potentials deprived of their mean values. The computations from the proof of Lemma 3.3 provide
[TABLE]
where the constant depends on and the lower bound from • ‣ 2, but not on the fixed point or . Since all norms on finite dimensional spaces are equivalent, there exists such that and we obtain
[TABLE]
for large enough. This provides the second inequality in (3.9). In order to establish the first inequality we again use the computations from the proof of Lemma 3.3 to show
[TABLE]
with . For every fixed , there is a constant such that \left.\kern-1.2pt\Phi^{*}\vphantom{\big{|}}\right|_{\Gamma}^{T}\mathbf{M}_{\Gamma}\left.\kern-1.2pt\Phi^{*}\vphantom{\big{|}}\right|_{\Gamma}\leq C_{h}{\Phi^{*}}^{T}\mathbf{M}_{\Omega}\Phi^{*}. Hence, we have
[TABLE]
with independent of and . Choosing and small enough provides . Hence, we obtain the first inequality in (3.9) for large enough, which completes the proof. ∎
Remark 3.5**.**
The existence result in Lemma 3.3 implies no constraints on the time increment . Therefore, we have the existence of discrete solutions for arbitrary time increments.
4. Convergence of the discrete scheme
In this section, we show that the discrete solutions established in the last section converge towards suitable weak solutions of (1.1). This requires some assumptions on the initial data. In particular, we will assume that
- •
the initial data and its projection onto satisfies
[TABLE]
with some independent of and .
Furthermore, the regularity results provided in this section require additional assumptions on and . In particular, we will need
- •
that for when and that for when .
Assumption • ‣ 4 allows us to state our first regularity result.
Corollary 4.1**.**
*Let the assumptions • ‣ 2, • ‣ 2, • ‣ 2, • ‣ 2, • ‣ 2, and • ‣ 4 hold true and let be small enough. Then a solution to (2.9) satisfies *
[TABLE]
with a constant independent of and .
Proof.
After summing the result of Lemma 3.3 over all time steps and recalling Corollary 3.2 and • ‣ 4, it remains to show that we have indeed control over the complete norm of and . To establish this result, we will follow the lines of [26]. Testing (2.9c) by with , which is not identically zero, we obtain
[TABLE]
From • ‣ 2 and • ‣ 4, we obtain
[TABLE]
Hence, there exists a constant independent of and such that . We now define
[TABLE]
From standard error estimates for the interpolation operator (cf. [10]), we derive the existence of such that for small enough. Therefore, we may use the generalized Poincaré inequality (cf. [2]), which we cite in the appendix as Lemma A.1, with and to obtain
[TABLE]
To obtain the -bound for , we test (2.9c) by and obtain
[TABLE]
Considerations similar to (4.2) show that the last term on the right-hand side is also bounded by a constant independent of and . Therefore, we may use Poincaré’s inequality to complete the proof. ∎
In a second step, we derive uniform bounds for the time difference quotient of the phase-field parameter on and .
Lemma 4.2**.**
Let the assumptions • ‣ 2, • ‣ 2, • ‣ 2, • ‣ 2, • ‣ 2, • ‣ 4, and • ‣ 4 hold true. Furthermore, let be small enough such that Corollary 4.1 holds true. Then a solution to (2.9) satisfies
[TABLE]
with independent of and .
Proof.
We take and test (2.9a) by , where is the orthogonal -projection onto . We decompose the first term in (2.9a) into
[TABLE]
The first term will be used to obtain a norm on the dual space of . The second term can be controlled via Lemma 2.1 and the -stability of (cf. [9]). Using these considerations and Hölder’s inequality, we obtain
[TABLE]
Dividing by , taking the second power on both sides, multiplying by , and summing over all time steps provides
[TABLE]
Applying the already established regularity results and • ‣ 4 completes the proof of the left inequality in (4.5). For the case , the right inequality in (4.5) can be established using similar computations. In the case , we combine Lemma 2.1 with an inverse estimate and obtain
[TABLE]
Again, the already established regularity results and • ‣ 4 complete the proof. ∎
In order to pass to the limit , we define time-interpolants of time-discrete functions , , and introduce some time-index-free notation as follows.
[TABLE]
We want to point out that the time derivative of coincides with the difference quotient, i.e.
[TABLE]
If a statement is valid for , , and , we use the abbreviation . With this notation, system (2.9) reads as follows.
[TABLE]
for all . Similarly, we can rewrite the regularity results obtained in Corollary 4.1 and Lemma 4.2 as
[TABLE]
These regularity results can be used to identify converging subsequences.
Lemma 4.3**.**
Let the assumptions • ‣ 2, • ‣ 2, • ‣ 2, • ‣ 2, • ‣ 2, • ‣ 4, and • ‣ 4 hold true. Furthermore, let be a solution to (4.12). Then there exists a subsequence (again denoted by ) and functions
[TABLE]
such that almost everywhere on and for
[TABLE]
Proof.
The weak and weak∗ convergence expressed in (4.15a), (4.15b), (4.15g), and (4.15h) follows directly from the bounds in (4.13a) and (4.13b). The strong convergence in (4.15c) then follows from the bounds for in , the bounds on in , the Aubin–Lions theorem, and the fact that , , and converge towards the same limit function due to the bound on .
Similar arguments provide (4.15d)-(4.15f) in the case . In the case , we use the uniform bound on to deduce a uniform bound for . As is compactly embedded in for (cf. [45]), we verify (4.15d)-(4.15f) for . It remains to show that can be identified with . We choose and compute
[TABLE]
∎
Theorem 4.4**.**
Let and let the assumptions • ‣ 2, • ‣ 2, • ‣ 2, • ‣ 2, • ‣ 2, • ‣ 4, and • ‣ 4 hold true. Then a tuple satisfying
[TABLE]
can be obtained from discrete solutions to (2.9) by passing to the limit . This tuple solves (1.1) in the following weak sense:
[TABLE]
Proof.
We start by passing to the limit in (4.12a). Choosing for , we have in (cf. [10]). We decompose the first term as
[TABLE]
This allows us to combine the results from (4.6) and (4.7) with (4.15b) and (4.15g) to derive (4.18a) for . Noting that is dense in yields the result. Similar arguments allow us to pass to the limit in (4.12b) to obtain (4.18b).
In order to pass to the limit in (4.12c), we choose with and assume that , which is the case for and . While the convergence of the left-hand side of (4.12c) and the gradient terms is straightforward, the convergence of the terms including the derivative of the potential functions and require more finesse. We will showcase the convergence of . Then, the convergence of the remaining parts can be obtained in an analogous manner. According to • ‣ 2, can be written as the sum of a polynomial of degree three and a globally Lipschitz-continuous component . We start with the decomposition
[TABLE]
The convergence of the first term on the right-hand side follows directly from (4.15f) and the strong convergence of . Therefore, it remains to show that the remaining terms vanish when passing to the limit. Recalling that is continuously embedded in (cf. [45]), the estimates in Lemma 2.1 and the standard inverse estimates (cf. [10]) provide
[TABLE]
Therefore, the last term in (4.20) vanishes. Furthermore, we derive the estimates
[TABLE]
and
[TABLE]
As , we obtain the convergence of the polynomial part of . To deal with the Lipschitz-continuous part , we start with the decomposition
[TABLE]
Combining Lemma 2.1 with a standard inverse estimate, we compute
[TABLE]
Using the Lipschitz-continuity of , we deduce
[TABLE]
with a constant depending on the Lipschitz-constant of . Furthermore, the Lipschitz-continuity provides on every
[TABLE]
Consequently, an inverse estimate yields
[TABLE]
which proves that will also vanish when passing to the limit. From the strong convergence (4.15f), we deduce almost everywhere. Recalling , we may use Vitali’s convergence theorem (see e.g. [2]) to show in for . The convergence of derivatives of the concave parts of follows from the same arguments. The uniform bounds of in provide enough regularity, to adapt the previously presented arguments to three spatial dimensions, which proves the convergence of the remaining terms. As is dense in , this concludes the proof. ∎
Remark 4.5**.**
The results presented in the preceding sections carry over to the case of Allen–Cahn-type dynamic boundary conditions (cf. (1.8)), where we use
[TABLE]
instead of (2.9b). The resulting scheme reads
[TABLE]
*and is well defined, as {\left(m\left.\kern-1.2pt\mathbf{L}_{\Omega}\vphantom{\big{|}}\right|_{\Gamma\times\Gamma}+m_{\Gamma}\left.\kern-1.2pt\mathbf{M}_{\Omega}\vphantom{\big{|}}\right|_{\Gamma\times\Gamma}\mathbf{M}_{\Gamma}^{-1}\left.\kern-1.2pt\mathbf{M}_{\Omega}\vphantom{\big{|}}\right|_{\Gamma\times\Gamma}\right)} is obviously a symmetric, positive definite matrix.
Although, is not conserved when using Allen–Cahn-type boundary conditions, testing (4.29) by shows that is bounded. Consequently, the energy estimate still provides control over .
Testing (4.29) by shows , i.e. we obtain a slightly better regularity result for the discrete time derivative than we obtained for Cahn–Hilliard-type boundary conditions. Using the time-index-free notation introduced in (4.10), the bounds read*
[TABLE]
*with independent of and . Based on these uniform bounds, we are able to identify converging subsequences and pass to the limit.
Variants of these boundary conditions are used to describe dynamic contact angles. To recover the boundary condition suggested in [47], we choose , , and , where the parameter prescribes the static contact angle via Young’s formula. As satisfies • ‣ 2 and • ‣ 2 the previous results are also valid for the boundary condition (1.9).
5. Numerical simulations
In this section, we present simulations to underline the practicality of the proposed scheme (2.23), which we implemented in the C++ framework EconDrop (cf. [32, 11, 31, 40, 39]). This framework allows for adaptivity in space and time using the ideas presented in [32], i.e. we are able to use meshes with a high resolution in the evolving interfacial area and a lower resolution in the bulk phases where . Similarly, the time increments can be varied such that they are small, when the solution changes rapidly and larger when the solution is almost stationary. In the presented simulations, we used Newton’s method to linearize (2.23), a biconjugate gradient stabilized method to solve the arising linear system, and a preconditioned conjugate gradient method to tackle the smaller auxiliary problem.
5.1. Scenario 1
As a first test case, we consider a phase-separation scenario in starting from the initial condition
[TABLE]
To keep close to the physical meaningful interval , we use the penalized double-well potential (cf. (2.8)) with penalty parameter for and . In this simulation, we use adaptive mesh refinement based on the criteria proposed in [32] using triangles with diameters between and . The dimensions of the corresponding finite element spaces are depicted in Fig. 5a. Examples of the used triangulations can be found in Fig. 2. The size of the time increment is also chosen adaptively based on the ideas presented in [32], which leads to time increments between and . The remaining parameters are listed in Tab. 1.
The evolution of the phase-separation process is depicted in Figure 1. Thereby, the light color represents the phase and the dark color represents in all pictures except the first one. As the initial data only contains values in , we rescaled Fig. 1a such that the light color corresponds to , while the dark color corresponds to .
The phase-separation starts with the typical wave pattern (see Figs. 1b-1d), which then transforms into two entangled spirals (cf. Figs. 1e-1f). In the course of the simulation, the spirals retreat (cf. Figs. 1f-1l) reducing the fluid-fluid contact area. The corresponding decrease in energy of depicted in Fig. 3b.
Fig. 3a shows evolution of and . In theory, these quantities should be conserved. In our simulation, the deviation of these quantities from their initial values is of order and originates from the adaptivity of the used triangulation.
To compare (2.23) with the straightforward approach of solving (2.9) directly in terms of practicality, we investigate the dependence of the condition numbers on the size of the time increment. For this purpose, we computed the matrices needed in the first Newton step of both schemes for artificial time increments and estimated their condition number using the Matlab function condest. Averages of the condition numbers based on 51 equidistant points in time are plotted in Fig. 4. As expected, the condition numbers in the straightforward approach grow for vanishing . Applying a Jacobi preconditioner to the system reduces the condition number drastically. However, for vanishing the condition number of the preconditioned system still increases rapidly (cf. blue triangles in Fig. 4). On the contrary, the condition number for (2.23), drops for decreasing , as the matrix in (2.23) converges towards the identity.
As discussed in Rem. 2.5, solving (2.23) requires us to solve a smaller auxiliary problem repeatedly. In the discussed simulation, the average number of needed cg-iterations remained below 20 (cf. Fig. 5b).
When developing our scheme, we boiled (2.9) down to (2.23) using the fact that (2.9a) and (2.9b) have to provide identical values for the trace of . In order to validate our scheme, we use (2.23) to compute the new phase-field values, recover via (2.18), and check whether (2.9b) still holds true. In this simulation, the -norm of the deviation averages out to .
5.2. Scenario 2
In the second scenario, we are interested in the experimental order of convergence (EOC) for our scheme. Similar to the last section, we choose (cf. (2.8)) with penalty parameter for and and use . The remaining parameters are collected in Tab. 2. We consider the initial configuration
[TABLE]
As this configuration is unstable, the two phases will separate and form areas where is close to . For and , the evolution of in the time interval is depicted in Fig. 6. Thereby, the light color represents the phase and the dark color represents the phase . In order to visualize the initial condition, we rescaled Fig. 6a so that the dark color corresponds to and the light color to . Again, the separation process reduces the energy of the system (cf. Fig. 7a).
To compute an experimental order of convergence, we repeat the above simulation with , , and , . These spatial discretizations correspond to and . Fixing , we use the solution obtained for as reference solution and define
[TABLE]
where the integration in time is approximated by a trapezoidal rule with step size . The experimental order of convergence w.r.t. is then defined as
[TABLE]
Analogously, we define and using the -norm. As shown in Tab. 3, we obtain order 2.3 for the convergence of w.r.t. on and for the convergence of on .
In a similar manner, we fix , use the solution corresponding to as reference solution, and define , , , and accordingly. As it can be seen in Tab. 4, the computed convergence order w.r.t. the time increment is 1.6 for and its trace .
Again, we conclude this section by evaluating the reliability and the efficiency of our scheme based on the conservation of mass, validity of (2.9b), the average condition number, and the average number of cg-iterations needed to solve the auxiliary problem. As illustrated in Fig. 7b, our scheme conserves and perfectly for all considered values of and , if the triangulation is fixed. As explained in the last section, we may use (2.18) to recover and compute the trace of using (2.9b). For and the -norm of the deviation averages to .
As it was done for the last scenario, we computed the matrices used in the first Newton iteration in the different schemes for various artificial time increments and estimated their condition number using the Matlab function condest. The average condition numbers based on 51 equidistant points in time are plotted in Fig. 8. As before, the matrices arising when solving (2.9) directly are ill-conditioned for small time increments. A Jacobi preconditioner is able to reduce the condition number drastically, but can not overcome the structural problem of this approach. Fig. 7c shows the average number of cg-iterations needed to solve the auxiliary problem for and different values of . Again, the auxiliary problem can be solved with very few iterations.
Appendix A Appendix
For the reader’s convenience, we provide the generalized Poincaré inequality which can be found in [2].
Lemma A.1**.**
Let be open, bounded and connected with Lipschitz boundary . Moreover, let and let be nonempty, closed and convex. Then the following items are equivalent for every :
- (1)
There exists a constant such that for all
[TABLE] 2. (2)
There exists a constant with
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] H. Abels and M. Wilke , Convergence to equilibrium for the Cahn–Hilliard equation with a logarithmic free energy , Nonlinear Analysis: Theory, Methods & Applications, 67 (2007), pp. 3176 – 3193, https://doi.org/10.1016/j.na.2006.10.002 . · doi ↗
- 2[2] H. W. Alt , Linear functional analysis : An application-oriented introduction , Universitext,, Birkhäuser, London, 2016.
- 3[3] J. W. Barrett, J. F. Blowey, and H. Garcke , Finite Element Approximation of the Cahn–Hilliard Equation with Degenerate Mobility , SIAM Journal on Numerical Analysis, 37 (1999), pp. 286–318, https://doi.org/10.1137/s 0036142997331669 . · doi ↗
- 4[4] J. W. Barrett, J. F. Blowey, and H. Garcke , On fully practical finite element approximations of degenerate Cahn-Hilliard systems , ESAIM: Mathematical Modelling and Numerical Analysis, 35 (2001), pp. 713–748, https://doi.org/10.1051/m 2an:2001133 . · doi ↗
- 5[5] P. W. Bates and P. C. Fife , The Dynamics of Nucleation for the Cahn–Hilliard Equation , SIAM Journal on Applied Mathematics, 53 (1993), pp. 990–1008, https://doi.org/10.1137/0153049 . · doi ↗
- 6[6] J. F. Blowey, M. I. M. Copetti, and C. M. Elliott , Numerical analysis of a model for phase separation of a multi-component alloy , IMA Journal of Numerical Analysis, 16 (1996), pp. 111–139, https://doi.org/10.1093/imanum/16.1.111 . · doi ↗
- 7[7] J. F. Blowey and C. M. Elliott , The Cahn–Hilliard gradient theory for phase separation with non-smooth free energy Part I: Mathematical analysis , European Journal of Applied Mathematics, 2 (1991), pp. 233–280, https://doi.org/10.1017/s 095679250000053 x . · doi ↗
- 8[8] J. F. Blowey and C. M. Elliott , The Cahn–Hilliard gradient theory for phase separation with non-smooth free energy Part II: Numerical analysis , European Journal of Applied Mathematics, 3 (1992), pp. 147–179, https://doi.org/10.1017/s 0956792500000759 . · doi ↗
