A Uniquely Solvable, Positivity-Preserving and Unconditionally Energy Stable Numerical Scheme for the Functionalized Cahn-Hilliard Equation with Logarithmic Potential
Abstract
We propose and analyze a first-order finite difference scheme for the functionalized Cahn-Hilliard (FCH) equation with a logarithmic Flory-Huggins potential. The semi-implicit numerical scheme is designed based on a suitable convex-concave decomposition of the FCH free energy. We prove unique solvability of the numerical algorithm and verify its unconditional energy stability without any restriction on the time step size. Thanks to the singular nature of the logarithmic part in the Flory-Huggins potential near the pure states , we establish the so-called positivity-preserving property for the phase function at a theoretic level. As a consequence, the numerical solutions will never reach the singular values in the point-wise sense and the fully discrete scheme is well defined at each time step. Next, we present a detailed optimal rate convergence analysis and derive error estimates in under a linear refinement requirement . To achieve the goal, a higher order asymptotic expansion (up to the second order temporal and spatial accuracy) based on the Fourier projection is utilized to control the discrete maximum norm of solutions to the numerical scheme. We show that if the exact solution to the continuous problem is strictly separated from the pure states , then the numerical solutions can be kept away from by a positive distance that is uniform with respect to the size of the time step and the grid. Finally, a few numerical experiments are presented. Convergence test is performed to demonstrate the accuracy and robustness of the proposed numerical scheme. Pearling bifurcation, meandering instability and spinodal decomposition are observed in the numerical simulations.
keywords:
Functionalized Cahn-Hilliard equation, Finite difference scheme, Logarithmic potential, Unique solvability, Energy stability, Positivity preserving, Optimal rate convergence analysis, higher order asymptotic expansionMSC:
[2020] 35K35 , 35K55 , 65M06 , 65M121 Introduction
We consider the following functionalized Cahn-Hilliard (FCH) equation:
(1.1) |
Here, we assume that is a given final time and with the spatial dimension . For the sake of simplicity, below we analyze the system (1.1) in a periodic setting on such that the variables , , satisfy periodic boundary conditions. With some minor modifications, our results can be extended to the case with homogeneous Neumann boundary conditions, or boundary conditions of mixed periodic-homogeneous Neumann type.
In the system (1.1), the scalar function denotes local concentrations of the two components in a binary mixture (e.g., an amphiphilic material in a solvent). Here we define as the difference of volume fractions. In view of its physical interpretation, only the values are admissible. The pure states correspond to the values (the pure solvent) and (the pure amphiphile), whereas indicates the presence of a mixing state. The scalar function is referred to as the chemical potential, which is the first variational derivative of the following free energy functional:
(1.2) |
where , and are given parameters. The energy (1.2) extends the classical Cahn-Hilliard energy in the literature (see [1])
(1.3) |
where stands for the (Helmholtz) free energy density of mixing and its derivative is denoted by . Then the scalar function in (1.1) corresponds to the first variational derivative of , which is the chemical potential in the classical Cahn-Hilliard theory for binary mixtures.
In (1.2), the positive parameter characterizes the width of inner structures, e.g., the (diffuse) interfaces between two components. Next, let us pay some more attention on the parameter , which plays an important role in the modelling and analysis. Indeed, the sign of can change fundamentally the structure of the problem as well as the physically motivating examples [2]. When , the energy reduces to the well-known phase-field formulation of the Willmore functional (PFW) that approximates the Canham-Helfrich bending energy of surfaces. The corresponding phase-field model has been used to study deformations of elastic vesicles subject to possible volume/surface constraints (see e.g., [3, 4]). When , the energy is related to the so-called Cahn-Hilliard-Willmore (CHW) energy, which was introduced in [5, 6, 7] to investigate strong anisotropy effects arising in the growth and coarsening of thin films. In this paper, our interest will focus on the case such that is referred to as the functionalized Cahn-Hilliard (FCH) energy in the literature. It was first proposed in [8] to model phase separation of mixtures with an amphiphilic structure. Later on, the extended FCH model was used to describe nanoscale morphology changes in functionalized polymer chains [9], amphiphilic bilayer interfaces [2, 10, 11], and membranes undergoing pearling bifurcations [12, 13]. With a positive parameter , the FCH energy (1.2) reflects the balance between the square of the variational derivative of against itself: the first term stabilizes bilayers, pores and micelle structures, while the second term promotes the growth of interfaces and competition between these geometries (see e.g., [14]). Minimizers of the FCH energy are approximate critical points of , which however favor more surface area. This fact dramatically changes the nature of the energy landscape and presents rich morphological structures that are quite different from the phase separation process described by the classical Cahn-Hilliard energy. The FCH energy can naturally incorporate the propensity of the amphiphilic surfactant phase to drive the creation of stable bilayers, or homoclinic interfaces with an intrinsic width [2]. In particular, the bilayer structure has the distinct feature that it separate two identical phases by a thin region of a second phase. For recent works on the minimization problem of the FCH energy, bilayer-structures, pearled patterns, nanostructure morphology changes and network bifurcations, we refer to [13, 14, 15, 16, 17] and the references cited therein. Finally, we note that the exponent in (1.2) distinguishes some natural limits of the FCH energy, when , it represents the strong functionalization, while the choice corresponds to the weak functionalization (see [10, 12, 15] for detailed discussions).
In this study, we work with the following thermodynamically relevant potential of logarithmic type:
(1.4) |
where is a given parameter. The potential function was proposed in the original work [1] on the phase separation of binary alloys and it also arises in the Flory–Huggins theory for polymer solutions [18]. The first order derivative of is denoted by such that
(1.5) |
When , has a double-well structure with two minima , where is the positive root of the equation . Besides, we observe that . This singular nature of near the pure states brings great challenges in the study of related phase-field equations, including the classical Cahn-Hilliard equation driven by . On the other hand, to avoid possible difficulties caused by the singularity of , a widely used approach is to work with an approximate polynomial like
(1.6) |
which is sometimes called the “shallow quenching” approximation of the logarithmic potential (1.4) (see e.g., [19, 20]). Concerning the Cahn-Hilliard equation with logarithmic potential (1.4), we refer to [19, 21, 22, 23, 24, 25, 26] for extensive theoretic analysis on well-posedness as well as long-time behavior of global solutions (see also the review articles [20, 27]), while for contributions in the numerical studies, we recall [28, 29, 30, 31, 32, 33, 34, 35, 36] and the references therein.
Under suitable boundary conditions (e.g., the periodic or Neumann type), the FCH equation (1.1) can be viewed as an gradient flow of the FCH energy (1.2), which not only dissipates the energy but also preserves the mass along time evolution. As long as a solution exists on and is sufficiently regular, it holds
(1.7) |
and
(1.8) |
Concerning the theoretic analysis of equation (1.1), when and the periodic boundary conditions are imposed, Dai et al. [37] proved the existence of global weak solutions in the case with a general regular potential including (1.6) and a degenerate mobility (see also [38]). For the case with the regular potential (1.6) and a constant mobility, existence and uniqueness of global solutions in the Gevrey class were established in [39] for , again in the periodic setting. We also mention [40, 41] in which some theoretic results for the Cahn-Hilliard-Willmore equation (with ) can be found. The case associated with a logarithmic potential (1.4) is more difficult. In the recent work [42], Schimperna and Wu investigated the initial boundary value problem of (1.1) subject to homogeneous Neumann boundary conditions with . After overcoming difficulties from the singular potential and its interaction with higher-order spatial derivatives, they proved existence, uniqueness and regularity of a global weak solution and characterized its long-time behavior. For a higher-order parabolic equation, in general we do not have maximum principle for its solution. Nevertheless, the singular character of the nonlinearity can help to keep the weak solutions of (1.1) staying away from the pure states at a point-wise level such that almost everywhere in . This is sometimes referred to as a positivity-preserving property, since both and hold. When the spatial dimension is less than or equal to two, an improved conclusion has been drawn in [42]: if the initial datum is strictly separated from , then there exists a uniform distance such that for all . This fact is crucial for obtaining higher order spatial regularity of solutions, since the singular potential is now confined on a compact subset of and thus is smooth. We note that similar properties have been proven for the classical Cahn-Hilliard equation with a logarithmic potential and for some extended systems, see for instance, [24, 25, 26] and the references therein.
Based on the analytic results obtained in [42], we are going to provide a detailed numerical analysis of the FCH equation (1.1) with logarithmic potential (1.4), subject to periodic boundary conditions. Observe that (1.1) is a sixth order parabolic equation for (see (2.3)–(2.4) below). Those nonlinear terms in the chemical potential such as , , with (see (2.4)) present a highly nonlinear and singular nature of the problem, which turns out to be more involved than the fourth order Cahn-Hilliard equation. This feature yields great challenges in the numerical study. One obvious difficulty is to overcome the step restriction in the time-space discretization such that an explicit numerical scheme will require a rather restrictive Courant-Friedrichs-Lewy (CFL) condition like , with and being the time and spatial step sizes, respectively. On the other hand, a fully implicit scheme like backward Euler may be difficult to prove its unique solvability and only conditionally energy stable. Our goal is to present a numerical scheme that is uniquely solvable, preserving the mass conservation, energy dissipation and the positivity property, under some mild refinement requirement. Besides, we shall apply some efficient numerical solvers to solve the numerical scheme in the long-time scale simulation.
There have been some progresses on the numerical study of the FCH equation (1.1) with and a polynomial potential like (1.6). In [14], Jones proposed a semi-implicit numerical scheme and proved its energy stability but the unique solvability was not given. He also made comparisons among semi-implicit, fully-implicit and explicit exponential time differencing (ETD) numerical schemes. A fully implicit scheme with pseudo-spectral approximation in space was introduced in Christlieb et al. [43], where the authors performed numerical tests to show its accuracy and efficiency but did not prove energy stability and solvability. In [44], Guo et al. presented a local discontinuous Galerkin method to overcome the difficulty associated with higher order spatial derivatives. Energy stability was shown for the semi-discrete (time-continuous) scheme therein. Later on, a convex-concave splitting scheme was proposed in Feng et al. [45], where the unique solvability and unconditional energy stability were theoretically verified. Besides, the authors performed the convergence analysis and applied an efficient preconditioned steepest descent algorithm to solve their scheme. Recently, theoretical analysis on the energy stability of a stabilized semi-implicit scheme for the FCH equation was carried out in [46]. We also refer to [47] for an unconditionally energy stable second-order numerical scheme based on the scalar auxiliary variable (SAV) approach, to [48] for a highly accurate, linear and unconditionally energy stable large time-stepping scheme, and to [49] for numerical comparison between those schemes based on the stable SAV approach and the classical BDF method.
It is worth mentioning that all the previous numerical studies mentioned above are associated with a regular (polynomial) potential. To the best of our knowledge, there is no result on the numerical analysis of the FCH equation (1.1) with the logarithmic potential (1.4) in the existing literature. Here we aim to make the first attempt in this direction. The main contributions of this paper are summarized below.
(1) We propose a first-order semi-implicit finite difference numerical scheme (see (2.18)–(2.19)), based on a suitable convex-concave decomposition of the highly nonlinear FCH energy (see Proposition 2.3).
One main difficulty comes from the troublesome term in the FCH energy, which is neither convex nor concave (cf. (2.8)). Using integration by parts and the periodic boundary conditions, we can rewrite it as instead. Thanks to the strict separation property of (see Proposition 2.2), we are able to show that the new functional (and its discrete analogue) is strictly convex on a suitable closed set (cf. [42, 50] for conclusions in some weaker settings). This observation enables us to derive the desired convex splitting scheme that treats the convex part of implicitly and the concave part explicitly. Our argument is different from the case with the regular potential (1.6) studied in [45] such that no auxiliary term is required here to guarantee the necessary convexity.
(2) We prove that the proposed numerical scheme (2.18)–(2.19) is uniquely solvable, without any restriction on the size of the time step and the grid (see Theorem 3.1). Moreover, solutions to this fully discrete scheme preserve the mass at each time step (see Proposition 2.4) and satisfy the positivity-preserving property in the point-wise sense (see (3.1)).
The positivity-preserving property at the discrete level is crucial, since it guarantees the numerical scheme to be unconditionally well-defined. Concerning the Cahn-Hilliard equation with logarithmic potential (1.4), this issue was first tackled in [30] where Copetti and Elliott worked with a backward Euler scheme. Under certain constraint on the time step, they proved the unique solvability and positivity-preserving property of numerical solutions by applying a regularization of the singular potential and then passing to the limit. An alternative approach was recently introduced in Chen et al. [29], based on the convex-concave decomposition technique (see e.g., [51, 52]). They proposed a first order semi-implicit convex splitting scheme as well as a second order accurate scheme involving the implicit backward differential formulation (BDF). Then they overcame the time step restriction and theoretically justified the unique solvability and energy stability of those schemes. In particular, the logarithmic part was treated in an implicit way and its convexity as well as singularity helped to prevent the numerical solution from approaching the singular values . Later in Chen et al. [28], a similar idea was applied to show the positivity-preserving property of a second order accurate scheme with a modified Crank-Nicolson approximation. Further applications can be found in recent works on the Cahn-Hilliard equation with a Flory-Huggins-de Gennes energy [53, 54], the Poisson-Nernst-Planck system [55] and the reaction-diffusion system with detailed balance [56] etc.
In this study, we successfully generalize the argument in [29] to the sixth order FCH equation (1.1). Roughly speaking, for any , we look for a discrete solution to the numerical scheme (2.18)–(2.19) by solving a minimization problem form certain discrete energy derived from the convex-concave energy decomposition (see (3.2)). If the numerical solution in the previous time step (denoted by ) takes all its grid values in and its discrete average also belongs to , we can use the specific form of the logarithmic term and in particular, its singular nature near to show that the solution that is a (global) minimum of , must exist and can only possibly occur at an interior point in the numerical solution variable domain (see (3.4)). Besides, uniqueness of the numerical solution is a direct consequence of the strict convexity of the discrete energy function.
(3) We verify the unconditional energy stability of the proposed semi-implicit numerical scheme (2.18)–(2.19), see Theorem 4.2. The proof is based on the convex-concave decomposition of the discrete FCH energy given in Corollary 2.1. Moreover, the unconditional energy stability enables us to derive a uniform in time -bound for the numerical solutions (see Corollary 4.1), which plays an important role in the subsequent convergence analysis.
(4) We perform an optimal rate convergence analysis for the numerical scheme (2.18)–(2.19) and establish an error estimate with accuracy in , under a linear refinement requirement on the time step size such that (see Theorem 5.3).
To obtain the expected error estimate under the above linear refinement constraint, a crucial step is to construct a higher order asymptotic expansion of the exact solution up to the second order temporal and spatial accuracy (see (5.11)). A similar idea was used in [55] for the optimal rate convergence analysis of the Poisson-Nernst-Planck system. Here in our case, based on the lower order error estimate in the discrete space (see (5.35)) we can first derive a rough estimate on the modified numerical error function in (see (5.29)), which combined with the inverse inequality further leads to an error estimate in (see (5.30)), provided that and are suitably small and satisfy the linear constraint . Furthermore, this estimate allows us to show that all the numerical solutions can be kept away from the pure states with a uniform positive distance (see (5.31)). Hence, the singular term (and its derivatives) is confined on a compact subset of , becoming regular and uniformly bounded. With this crucial observation, we can proceed to derive the required higher order error estimate in by using the energy method.
The remaining part of this paper is organized as follows. In Section 2 we present some analytic results on the continuous problem and propose the numerical scheme. In Section 3, we provide detailed proofs on unique solvability of the scheme and the positivity-preserving property of numerical solutions. The unconditional energy stability is then established in Section 4. In Section 5, we perform an optimal rate convergence analysis and derive the error estimates. Numerical experiments are presented in Section 6 to verify the accuracy and efficiency of our scheme. The mass conservation, energy dissipation and positivity-preserving properties are verified numerically. In the final Section 7, we make some concluding remarks.
2 The Numerical Scheme
2.1 Preliminaries: well-posedness of the continuous problem
Let be a (real) Banach or Hilbert space with the associated norm denoted by . The symbol stands for the dual space of and denotes the duality product between and . Throughout the paper, we consider the domain with . For , we set
Next, we recall some standard notations for Lebesgue and Sobolev spaces in the periodic setting (see, e.g., [39]). For , we define
For and , we define
When , we simply denote , by , , respectively. The standard scalar product of will be denoted by . For , we also define the dual spaces
For the sake of convenience, we denote by the convex part of the logarithmic potential and by the monotone part of its derivative (see [42]), that is,
(2.1) | |||
(2.2) |
In [42], Schimperna and Wu investigated the system (1.1) in a bounded smooth domain , , subject to the homogeneous Neumann boundary conditions on ( denotes the unit outer normal vector on the boundary ). They proved existence and uniqueness of a global weak solution to the resulting initial boundary value problem and established its regularity for any positive time, see [42, Theorems 2.3, 2.4]. With minor modifications on the proofs therein, we are able to obtain similar results for the FCH equation (1.1) in the periodic setting.
Proposition 2.1 (Well-posedness).
Let with . Suppose that is determined by (1.4), and are given constants. For any initial datum satisfying
there exists a unique global weak solution to the system (1.1) subject to the periodic boundary conditions such that, for any ,
and the initial condition is satisfied almost everywhere in . The following weak formulations hold for almost all :
(2.3) | |||
(2.4) |
Besides, the weak solution satisfies the mass conservation such that
and for any satisfying , we have the energy equality:
Next, we present the property of strict separation from pure states for global weak solutions. This property holds globally (in time) when the spatial dimension is less than or equal to two, while it can only hold locally in the three dimensional case. In analogy to [42, Proposition 2.8] and keeping in mind the continuous embedding for (cf. [57]), we can prove the following result:
Proposition 2.2 (Strict separation from pure states).
Let the hypotheses of Proposition 2.1 be satisfied.
Assume that and . For any , there exists a constant such that the global weak solution obtained in Proposition 2.1 satisfies
Moreover, if for some given , then there exists such that
Assume that and for some given . Then there exists some (depending on ) such that
(2.5) |
Remark 2.1.
Proposition 2.2 indicates that if the initial datum is strictly separated from , then in the one or two dimensional case, for an arbitrary but fixed final time , the solution is strictly separated from on the whole time interval as well. On the other hand, in the three dimensional case, the strict separation property holds only in a “local” sense such that if is strictly separated from , then at least for some short period of time, the corresponding solution can be strictly separated from . Whether a global in time separation property holds in the three dimensional case remains an open problem. The above separation property is crucial, since it enables us to avoid the singularity of the logarithmic type function (which is indeed smooth on a closed subset of ) and then obtain arbitrary higher order regularity of solutions to (1.1), provided that the initial datum is sufficiently smooth.
2.2 The finite difference spatial discretization
We first recall some standard notations for discrete functions and operators, see e.g., [58, 59]. For the spatial discretization, we apply the centered finite difference approximation and adopt the periodic setting similar to that in [28, 29, 55]. Without loss of generality, below we just state the setting in the computational domain . It can be easily extended to more general cells like and to the lower dimensional cases .
Let be a given positive integer. We define the uniform spatial grid size as . The numerical value of a function at the cell centered mesh point is denoted by such that . Then we introduce the space of three dimensional discrete -periodic functions:
The discrete inner product on is defined as for any . For any , its mean value is given by (here we simply have ). Then we introduce the subspace of with zero mean such that
Next, we use the notation to denote the set of face-centered vector grid functions that are -periodic, i.e., -periodic in each direction. Here, we set
where . The other two spaces , are defined in an analogous manner.
The discrete average and difference operators acting on yield face-centered functions, evaluated at the east-west faces, ; north-south faces, ; and up-down faces, , respectively. We define , and such that
On the other hand, the corresponding operators at the staggered mesh points, that is, , , , are given by
Let us now introduce the discrete gradient and divergence operators , . For any , we set , while for any , we define . Suppose that is an arbitrary scalar function defined at all the face center points (east-west, north-south, and up-down) and , then we have
If for certain scalar grid function , it follows that
As a consequence, the standard three dimensional discrete Laplacian can be defined as
For , the discrete norms are given by . When , we simply denote by . In addition, the discrete maximum norm in is defined as . For any two vector grid functions , we define the discrete inner product as follows
where
With the above notations, we can further define
(2.6) |
and the discrete Sobolev-type norms through
and so on. When , we simply denote the norm by , .
A discrete version of the space is also necessary in the subsequent analysis. For any , let be the unique periodic solution of the discrete elliptic equation (cf. [59, Lemma 3.2]). Then the inner product and the associated norm can be defined by
and for any . The above definition is a direct consequence of the following lemma on the discrete summation-by-parts formulae, cf. [59, Lemma 3.3], see also [58, 60, 61].
Lemma 2.1.
Let be an arbitrary periodic scalar function defined on all of the face center points. For any and any , the following summation-by-parts formulae are valid:
Before ending this subsection, we also recall the following result (see [29, Lemma 3.1]) that will be useful in the subsequent analysis:
Lemma 2.2.
Suppose that , satisfying and , the following estimate holds:
(2.7) |
where the constant only depends on .
2.3 A convex-concave energy decomposition
Before proceeding, let us mention that although the sign of the parameters does not play an essential role in the theoretic analysis of the continuous problem (1.1), it will leads to some differences in the corresponding numerical schemes (see Remark 2.3 for detailed discussions). In the remaining part of this paper, we will focus on the physical relevant case (i.e., the FCH energy with a logarithmic, possibly double-well potential ) and assume that
In order to design a numerical scheme with unconditional energy stability, we shall perform a convex-concave decomposition for the FCH energy given by (1.2). In view of (2.1) and (2.2), it can be rewritten in the following way:
(2.8) |
The term in (2.8) turns out to be tricky since it is neither convex nor concave. To overcome this difficulty, using the periodic boundary conditions, we perform integration by parts and obtain
(2.9) |
The above procedure is meaningful, if the function is sufficiently regular, for example, and satisfies the strict separation property (keeping in mind the singular nature of and its derivatives).
Thanks to (2.9), we can derive the following result:
Proposition 2.3.
The reformulated FCH energy (2.9) possesses a convex-concave decomposition such that
where
For any given , both and are strictly convex when restricted to the set of functions satisfying in .
Proof.
We adapt the arguments in [42, Lemma 5.3]. For any satisfying for some , by a direct calculation we can deduce that
for any . A further calculation yields
for any . Then taking , we find that (cf. [50, (6.5)])
Recalling (2.2), we observe that for , it holds
(2.10) | |||
(2.11) | |||
(2.12) | |||
(2.13) |
As a consequence, we can conclude
where is a constant that may depend on the positive parameters , , and , but are independent of and . The proof is complete. ∎
Corresponding to (2.9), for any , we introduce the discrete energy
(2.14) |
In analogy to Proposition 2.3, we can deduce that
Corollary 2.1.
The discrete energy possesses a convex-concave decomposition:
(2.15) |
where
(2.16) | |||
(2.17) |
Both and are strictly convex when restricted to the set of functions satisfying .
Remark 2.2.
Since only takes its values at finite points in , then the condition indeed implies that there exists some such that .
2.4 The first order numerical scheme
Using the convex splitting method [51, 52] and the convex-concave energy decomposition in Corollary 2.1, we introduce a first order semi-implicit numerical scheme for the functionalized Cahn-Hilliard equation (1.1) (cf. also (2.4) for an alternative expression of ). To this end, for a uniform time step , given with (), we look for the discrete solution such that
(2.18) | |||
(2.19) |
It is straightforward to check that for every solution to the numerical scheme (2.18)–(2.19), if it exists, then it must satisfy the property of mass conservation (cf. Proposition 2.1 for the continuous problem). More precisely, we have
Proposition 2.4 (Mass conservation).
For every , it holds . As a consequence, we have for all .
Remark 2.3.
For the Cahn-Hilliard-Willmore system, namely, the case with and , using a similar idea for (2.18)–(2.19), we can propose the following convex-splitting scheme:
(2.20) | |||
(2.21) |
Furthermore, when and , we can replace the last four terms on the right-hand side of (2.21) by . Theoretic analysis and numerical experiments of these modified schemes will be carried out in the future study.
3 Unique Solvability and Positivity-Preserving Property
Our aim in this section is to show that for every , the numerical scheme (2.18)–(2.19) is uniquely solvable for any time step size and grid size . In particular, the discrete solution satisfied the positivity-preserving property such that it is strictly separated from the pure states , i.e., (cf. [28, 29] for the classical Cahn-Hilliard equation).
The main result of this section reads as follows:
Theorem 3.1 (Unique solvability and positivity-preserving property).
Proof.
We divide the proof of Theorem 3.1 into several steps.
Step 1. Define the discrete energy:
(3.2) |
where is given by (2.16) and
(3.3) |
In view of Proposition 2.4, we introduce the admissible set
(3.4) |
The existence of a solution to the discrete system (2.18)–(2.19) can be proved by seeking a minimizer of the energy over the set . For the sake of convenience and thanks to the mass conservation, we introduce the new variable with zero mean
and rewrite into the following equivalent form:
Then is defined on the shifted admissible set given by
It is straightforward to check that if minimizes , then minimizes , and vice versa.
Step 2. To show the existence of a minimizer of in , for any given , let us consider the auxiliary set
(3.5) |
which is a bounded, closed and convex subset of . Thus from the construction of , we easily infer that it admits at least one minimizer over .
Step 3. We now derive the key property that every minimizer of cannot occur on the boundary of , provided that the parameter is sufficiently small. Here, by the boundary of , we mean the set of functions such that .
The above claim can be proved by using a contradiction argument (cf. [29] for the Cahn-Hilliard equation). Suppose that for some , a minimizer of in , which is denoted by , occurs at a boundary point of . Then there is at least one grid point such that . Without loss of generality, we assume that . This implies that the grid function takes its (global) minimum at . On the other hand, let be a grid point at which achieves its maximum. It follows that , since . Besides, from the fact , we infer that .
Since is indeed smooth over , then its directional derivative can be calculated as
In particular, we choose the direction with . This yields that
(3.6) |
The first two terms on the right-hand side of (3.6) can be estimated by using Lemma 2.2 such that
(3.7) |
For the third and fourth terms, recalling the definition of and (3.5), we find that
(3.8) | |||
(3.9) |
Estimate for the fifth term involving turns out to be more tricky. For simplicity, we only consider the estimate along the -direction. A direct calculation yields that
Here, we denote by for simplicity (as we only consider the -direction). Using Taylor’s expansion for and at , we obtain
(3.10) |
Here is between and , while is between and . The last inequality in (3.10) holds thanks to the definition of (i.e., the minimum point of ) so that , , and the fact that for any . Similar results can be derived for the , direction. Besides, for the term involving , we can conclude
(3.11) |
Next, we infer from (2.10)–(2.11) that the nonlinear function is strictly increasing on . Since and , then we have
(3.12) |
Finally, we treat the term involving (see (3.3)). From the assumption and the fact that for any given , there are only finite number of grid points, we can find some such that
(3.13) |
Here, the constant may depend on the parameter . From the refined bound (3.13) and the assumption , we see that
(3.14) |
Collecting the estimates (3.7)–(3.14), we can deduce from (3.6) that
where
and
Observe that is a constant that may depend on , , , , , but is independent of . Since
and is strictly increasing on , we can find some sufficiently small such that
(3.15) |
which gives
This contradicts the assumption that attains its minimum at , because the directional derivative is strictly negative along a specific direction pointing into the interior of .
By a similar argument, we can show that for any , a minimizer of over cannot occur at a boundary point such that , for some .
In summary, there exists a such that for every , the (global) minimum of over the set exists and it can be only attained at a certain interior point .
Step 4. Let be a minimizer of over , where is given in the previous step (see (3.15)). Below we show that must be the unique minimizer of over . In other words, is the unique minimizer of over .
First, for every , if is a minimizer of over , then it is unique. This is equivalent to say that is the unique minimizer of over . Indeed, similar to the proof of Proposition 2.3, we know that the discrete energy is strictly convex on . Since the first term in is quadratic and the third term is linear in , we deduce that is strictly convex on the set as well. Thanks to the strict convexity of over , the minimizer is unique.
Next, for every , we denote the unique minimizer of over by . Since , then we have . Let us consider two cases.
Case 1. For all , it holds . In this case, is a minimizer of over as well. Thanks to the uniqueness, it easily follows that for any and thus is indeed the unique minimizer of over .
Case 2. There exists some , the corresponding unique minimizer of over , denoted by , satisfies . In this case, from Step 3, we can find a constant , such that . Besides, since , we must have . Now let us denote the unique minimizer of over by . From Step 3, we find , which implies that . On one hand, since , then . On the other hand, it follows from that . Thus, so that should also be a minimizer of over . Thanks to the uniqueness of minimizer in , we have , which leads to a contradiction. Hence, the situation described in Case 2 will never happen.
In summary, the energy functional admits a unique minimizer over the set such that satisfies
This yields that is the unique solution to the discrete system (2.18)–(2.19). In particular, by the same argument as that for (3.13), we can find some such that
(3.16) |
The proof of Theorem 3.1 is complete. ∎
Remark 3.1.
In view of (3.15), the distance between the discrete solution and the pure states may not be uniform with respect to the index . Nevertheless, when the spatial dimension is less than or equal to two, from Proposition 2.2, the convergence analysis and error estimates given in Section 5, we can derive a uniform separation property for the discrete solution (see (5.31) below).
4 Unconditional Energy Stability
In this section, we show that the numerical scheme (2.18)–(2.19) is unconditionally energy stable. This property follows from the convex-concave decomposition of the discrete energy (recall Corollary 2.1).
Theorem 4.2 (Unconditional energy stability).
Proof.
Similar to the proof of Proposition 2.3, for the decomposed discrete energy , we have
for any satisfying . Thanks to Theorem 3.1 and Corollary 2.1, we can deduce the following inequalities for the discrete solution :
Combining the above results with (2.18)–(2.19), and using the summation-by-parts formulae (see Lemma 2.1), we obtain the energy dissipative property (4.1):
The proof is complete. ∎
The energy dissipation property enables us to derive an uniform -estimate for the solution to the discrete system (2.18)–(2.19).
Corollary 4.1 (Uniform -estimate).
Proof.
It follows from (4.1) that for any . On the other hand, from the definition of , (2.10) and the -bound (3.1) for , we can deduce that
where may depend on , , , , but is independent of . Thus, as long as the initial discrete energy is finite, it holds that for any . This estimate combined with the fact leads to the conclusion (4.2). The proof is complete. ∎
5 Optimal Rate Convergence Analysis and Error Estimate
In this section, we perform the convergence analysis and derive error estimates for the discrete approximation of solutions to the FCH equation (1.1).
For the continuous problem (1.1) in the periodic setting with , , existence and uniqueness of a global weak solution denoted by has already been established in Proposition 2.1, provided that its initial datum satisfies , and . Besides, in view of Proposition 2.2 and the discussions made in Remark 2.1, hereafter we assume that the initial datum is smooth enough and strictly separated from so that the corresponding solution to the continuous problem (1.1) belongs to the regularity class such that
(5.1) |
on for some . Moreover, we assume that the following strict separation property holds:
(5.2) |
where . The assumption (5.1) on the smoothness of the exact solution may not be optimal, but they are sufficient for the subsequent convergence analysis.
Adapting the notations in [29, 55], we introduce the projection operator , which is the space of trigonometric polynomials of degree less than or equal to . Define
the (spatial) Fourier projection of the exact solution . If for some , the following estimate is well-known (see [62]):
(5.3) |
In particular, from (5.1) and the Sobolev embedding in three dimensions, we can take , in (5.3) and sufficiently small (i.e., is sufficiently large) so that the Fourier projection still preserves the strict separation property (however, with a relaxed bound):
(5.4) |
Given an arbitrary positive integer , we set the uniform time step as . For every with , we set
Since the exact solution preserves the mass (recall Proposition 2.1) and , it is straightforward to check that for all , the property of mass conservation also holds for the Fourier projection at the discrete level of time:
(5.5) |
Next, we define the canonical grid projection operator . For any , we set with grid values
Then for the fully discrete system (2.18)–(2.19), we take its initial datum as , i.e.,
(5.6) |
The error grid function that we are going to investigate is given by
(5.7) |
Keeping the definitions of and in mind, we infer from (5.5), (5.6) and Proposition 2.4 that
(5.8) |
As a consequence, we have
The main result of this section reads as follows
Theorem 5.3 (Error estimate).
Suppose that the exact solution of the FCH equation (1.1) belongs to the regularity class (see (5.1)) and satisfies the strict separation property (5.2). Then, provided that and are sufficiently small, and under the linear refinement requirement for some fixed , we have
(5.9) |
for any such that , where is defined as in (5.7) and the constant is independent of , and .
Remark 5.1.
5.1 Higher-order consistency analysis
First, applying the temporal discretization, we see that the Fourier projection solves the following semi-implicit equation:
(5.10) |
where the truncation error is given by
Recalling the assumptions (5.1)–(5.2), then using Taylor’s expansion in time and the error estimate (5.3) (e.g., with , ), we have
where the spatial function only depends on , , and it is sufficiently smooth in the sense that its derivatives are bounded. From the mass conservation (5.5) and the periodic boundary condition, we infer that . This fact combined with Taylor’s expansion further implies .
Performing a further spatial discretization to (5.10) and applying a careful consistency analysis via Taylor’s expansion, we can actually show that solves the discrete system (2.18)–(2.19) with a first order accuracy in time and a second order accuracy in space. However, a restrictive refinement condition like for some is needed to complete the proof. The detailed calculations are left to the interested readers.
In order to prove Theorem 5.3 under a weaker (i.e., linear) refinement condition on the time step size , we perform a higher-order consistency analysis for the auxiliary profile
(5.11) |
Here we note that the centered difference used in the spatial discretization gives local truncation errors with only even order terms. In this manner, we find that a higher order consistency of holds for the numerical scheme (2.18)–(2.19) with , see (5.23)–(5.24) below. The approximate expansion (5.11) enables us to derive a higher order convergence estimate of the modified numerical error function (see (5.28)) between the constructed profile and the numerical solution in the discrete norm (see (5.35)). This combined with the inverse inequality eventually yields a refined bound of the numerical solution , more precisely, the property of strict separation from pure states (see (5.31)) that is uniform with respect to the time step and the grid size (cf. Remark 3.1).
The supplementary field in the profile (5.11) only depends on the exact solution and can be constructed via a perturbation expansion argument (see e.g., [55, 63]). Indeed, we find the temporal correction by solving the following linear equation:
(5.12) |
subject to the zero initial condition and periodic boundary conditions. Once the Fourier projection is given, we take the external source term in (5.12) to be a smooth function satisfying
The existence and uniqueness of a solution to the linear sixth order parabolic equation (5.12) on can be easily proved, for instance, by using the Faedo-Galerkin method. In particular, the solution only depends on , and its derivatives in various orders are bounded (recalling that is sufficiently smooth). Moreover, it satisfies the zero mass property:
Next, an application of the semi-implicit discretization for (5.12) yields
(5.13) |
where we denote by , , , . At the discrete level of time, we note that for every , it also holds . This fact further implies
(5.14) |
Combining (5.10) and (5.13), we can obtain the following second order in temporal space truncation error for
such that
(5.15) |
Following arguments similar to those in [55, 64, 65], we can further derive the second order temporal correction as well as the spatial correction , respectively.
To this end, the next order temporal correction function is given by the linear equation
(5.16) |
subject to the zero initial condition and periodic boundary conditions. Like before, the solution depends only on the exact solution and its derivatives of various orders are bounded. An application of the semi-implicit discretization to (5.16) implies that
(5.17) |
Then a combination of (5.16) and (5.17) yields the third order temporal truncation error for the profile
such that
(5.18) |
Finally, we construct the spatial correction term to upgrade the spatial accuracy order. The following truncation error analysis for the spatial discretization can be obtained by using a straightforward Taylor expansion for :
(5.19) |
Subsequently, the spatial correction function is given by solving the linear equation
(5.20) |
subject to the zero initial condition and periodic boundary conditions. Again, the solution depends only on the (sufficiently) exact solution , with bounded differences of various orders.
Combining the above arguments, we have thus constructed the required auxiliary profile (recall (5.11)).
Remark 5.2.
Since the temporal/spatial correction functions , , are sufficiently smooth and bounded, applying the projection estimate (5.3) and the separation property (5.4) for , we can obtain a strict separation property for such that
(5.21) |
with , provided that the time step and the grid size are sufficiently small. Such a uniform separation property will be useful in the subsequent convergence analysis.
An application of a full discretization to (5.20) yields that
(5.22) |
Hence, for the profile , by a careful consistency analysis via Taylor’s expansion, we can eventually arrive at the following fully discrete scheme for its discrete counterpart such that (for the sake of simplicity, below we simply drop the projection operator in and )
(5.23) |
with the higher order truncation error
(5.24) |
Remark 5.3.
We note that the profile still satisfies the mass conservation property at the discrete level of both time and space. Indeed, from its definition, we observe that . Then from the mass conservation of , , and (see (5.8), (5.14)), we find that for every , , it holds
(5.25) |
Besides, we infer from (5.23) and (5.25) that the local truncation error also fulfills
(5.26) |
5.2 Error estimate in
We first derive a preliminary error estimate on the error grid function in the lower order space . Since for any , as shown before, the discrete norm is well defined for .
Proposition 5.1.
Suppose that the exact solution of the FCH equation (1.1) belongs to the regularity class (recall (5.1)) and satisfies the strict separation property (5.2). Then, provided that is sufficiently small, and under the linear refinement requirement for some fixed , we have
(5.27) |
for any such that , where the constant is independent of , and .
Proof.
With the aid of the auxiliary profile constructed above, we introduce an alternative numerical error function
(5.28) |
where is the discrete solution to the system (2.18)–(2.19). From Remark 5.3 we see that . Hence, the discrete norm is also well defined for the new error grid function for all , .
To proceed, we make the following a priori assumption at the previous time step:
(5.29) |
The a priori assumption (5.29) will later be recovered by the optimal rate convergence analysis at the next time step. From (5.29), the linear refinement constraint , and the inverse inequality, we can derive a discrete bound for the numerical error function:
(5.30) |
provided that is sufficiently small (we note that is independent of , and ). Here, the constant is determined as in (5.21), which is independent of . From (5.21) and (5.30), we can deduce that the numerical solution also satisfies the strict separation property at the previous time step:
(5.31) |
For any , , since , we find that is well defined. This allows us to subtract the numerical scheme (2.18)–(2.19) from (5.23) and then take (discrete) inner product between the resultant and . More precisely, we get
(5.32) |
where
Due to the monotonicity of on , we easily see that . Besides, from the convexity of
we can also conclude . Concerning , we can find some with its values staying between and , , such that
Then using (5.21) and (5.31), we obtain
where depends on , , and . The remaining two terms and can be estimated by simply using the Cauchy-Schwarz inequality such that
and
Collecting the above estimates, we infer from (5.2) that
(5.33) |
where depends on , , and . On the other hand, using the fact , the -estimate in [66, Proposition 2.2] such that
(5.34) |
and the interpolation inequality, we find
A similar estimate also holds for . Applying the above estimates and Young’s inequality, we can eventually write (5.33) as
where depends on , , and . Thus, for , using the fact , (5.24) and the discrete Gronwall inequality, we can conclude that
(5.35) |
where depends on , , and and .
It remains to recover the a priori assumption (5.29). Obviously, it is valid for . Then we apply an induction argument. Assume that (5.29) holds at the previous time step corresponding to . From (5.35) and the linear refinement constraint , we deduce that
(5.36) |
provided that and are sufficiently small. Hence, (5.29) holds for all .
5.3 Error estimate in
We are now in a position to prove Theorem 5.3.
Proof.
First, from the lower order error estimate (5.35) for the auxiliary numerical error , we have obtained a rough error estimate (5.29), which together with the inverse inequality yields the strict separation property of the numerical solution for all , (see (5.31)).
Next, subtracting the numerical scheme (2.18)–(2.19) from (5.23) and taking (discrete) inner product between the resultant and , we get
(5.37) |
where
For , we can find some with its values staying between and , , such that
where the constant only depends on . By a similar argument, we can estimate as
where the constant only depends on , , and .
Next, we handle by making the following decomposition:
Again, we can find some with its values staying between and , , such that
where depends on and norms of . For the second term, we infer from (5.31), Hölder’s inequality and the uniform -bound (4.2) that
Here, we have used the estimate for all and discrete interpolation inequalities. Combining the estimates for and , we deduce from (5.34) that
The term can be treated in a similar manner. Indeed, we have
Concerning , there exists some with its values staying between and , , such that
where we have used Lemma 2.1 and Hölder’s inequality. Similarly, for , we have
As a consequence, it holds
For the remaining two terms, an application of Cauchy-Schwarz inequality yields that
Combining the above estimates, we can deduce from (5.34) and (5.37) that
(5.38) |
which together with the fact leads to the following inequality
(5.39) |
Thanks to the truncation error (5.24) and the lower order error estimate (5.35), we deduce from (5.39) that
(5.40) |
Finally, by a comparison between the two error functions and (using (5.7), (5.11) and (5.28)), from the projection estimate (5.3), the uniform boundedness of , , , the estimates (5.35), (5.40), we can achieve the conclusion (5.9).
This completes the proof of Theorem 5.3. ∎
6 Numerical Experiments
In this section, we implement a preconditioned steepest descent (PSD) algorithm to solve the fully discrete numerical scheme (2.18)–(2.19), following the framework proposed in [67]. This algorithm has been applied to the FCH equation (1.1) with a regular potential (1.6) in [45]. Further applications can be found in [68] and the references cited therein.
Observe that our scheme (2.18)–(2.19) can be recast as a minimization problem of the discrete energy (2.14). This is equivalent to solve the zero point of the discrete variation of (2.14):
where
The essential idea of the PSD solver is to use a linearized version of the nonlinear operator as a pre-conditioner. Here, the preconditioner is defined as
where , are two parameters that can be adjusted. Obviously, is a positive, symmetric operator. In particular, this metric can be used to find an appropriate search direction for the steepest descent solver. Given the current iterate , we obtain the next iterate direction by finding a such that
where is the nonlinear residual of the iterate . Using this linear operator, we then solve the equation by the Fast Fourier Transform (FFT). Consequently, the next iterate is obtained as
where is the unique solution to the steepest descent line minimization problem
6.1 Convergence test
In this subsection we carry out an accuracy check for the numerical scheme (2.18)–(2.19). For simplicity, the computational domain is assumed to be the unit square , and the phase variable is given as
In particular, we see that and stays positive at a pointwise level, so no singularity occurs during the computation. In order to make become the solution of the PDE system (1.1), we have to add an artificial, time dependent forcing term, then we can continue to finish the convergence test.
We first give the parameters as , , and . We compute the numerical errors with grid size . To verify that our numerical scheme has first order in time and second order in space accuracy, we set the time step size and respectively, and plot versus to demonstrate the temporal convergence order. In the first case , the expected temporal numerical accuracy assumption indicates that . This is consistent with the red lines shown in Figure 1, with its slope approximately being . In the second case , the numerical error gradually approach the line with slope , as depicted with the purple dotted line.

6.2 Pearling bifurcation and meandering instability
6.2.1 Adaptive time adjust strategy
Hereafter, we apply an adaptive time strategy to perform our simulation. We set an upper bound and lower bound for both the energy decay rate and the phase change rate. If either of the two factors changes rapidly, that is, exceeding the upper bound, we shorten the time step, and if both factors change too slow, we increase the time step. The maximal time step is given as , and the upper bound and lower bound are set to be and , respectively.
6.2.2 The pearling bifurcation and sensitivity of the initial value
The pearling bifurcation is an important physical phenomenon that has been investigated in [12, 69, 13]. Several numerical simulations have been implemented in recent works [49, 48, 46], always with a regular potential. In our simulation, the following initial condition will be used:
(6.1) |
where the parameter controls the interface width of the initial datum. Here we set , , , and so that the minima of are given with . As a consequence, Figure 2, Figure 3 and Figure 4 show the time snapshots of simulations under different initial thickness of the ring. The pearl bifurcation appears when and , but fails to exist when . From this numerical experiment we can see that, the morphological structure of interfaces is highly sensitive to the initial datum. A slight change may lead to different intermediate states and long-time equilibria. The energy plot in Figure 5 shows a fast exponential decay at the beginning of the simulation, and when the pearl structure appears, the energy changes fast as well. In Figure 6 we observe that in the above three cases for pearling bifurcation, the FCH energy, the Cahn-Hilliard energy and the phase-field Willmore (PFW) energy decrease at the same time.















6.2.3 The meandering instability
The meandering instability is another interesting phenomenon investigated in the literature, see e.g., [12]. Some numerical tests can be found in [45, 46] with a regular potential. To proceed with our simulation, we consider the following initial condition:
(6.2) |
Besides, we set , , , and . Figure 7 shows the time snapshots of the meandering instability, and Figure LABEL:meanderenergy1 presents the FCH and Cahn-Hilliard energy change of this experiment. The FCH energy still decreases over time, however, the Cahn-Hilliard energy increases after the initial decay. This reflects the balancing between the two parts (PFW vs. Cahn-Hilliard) in the FCH energy.








6.3 Phase separation
In this subsection we simulate the phase separation process, namely, the spinodal decomposition of a binary mixture with possible amphiphilic structure. We start with the following random initial condition (cf. [45]):
(6.3) |
where are uniformly distributed random numbers in , and give the parameters as , , , and .
Snapshots of the phase separation process can be found in Figure 9. The minimum value and maximum value of the phase variable stays between and along time evolution, which keep a safe distance to the pure states and . This is consistent with the strict separation property proved in this paper (for the numerical scheme) and in [42] (for the partial differential equation). Meanwhile, the average mass has a error after iteration, which comes from possible cancellation errors when rounding off values at machine precision, as is shown in Figure 11. The energy plot show a similar property to that for the previous simulation on meandering instability, in which the Cahn-Hilliard energy also increases after the initial decay. Figure 10 shows some special structures that we capture in the simulation, and these can be also found in the experiment of [70].
















7 Concluding Remarks
In this paper, we present a first order semi-implicit finite difference scheme for the functionalized Cahn-Hilliard equation with a logarithmic Flory-Huggins type potential. The numerical scheme is derived based on the convex splitting technique. The non-convex and non-concave term in the FCH energy is handled by using integration by parts under periodic boundary conditions. Unique solvability, unconditional energy stability and mass conservation property of the numerical scheme are theoretically justified. Moreover, we establish the positivity-preserving property, i.e., the phase function stays in at a point-wise sense, with the aid of the singular nature of the logarithmic term . To the best of our knowledge, our numerical scheme is the first one that combines these four important theoretic properties for the FCH equation with a singular potential. Next, we perform an optimal rate convergence analysis and obtain error estimates in the higher order space under a linear refinement requirement . To achieve the goal, we choose to perform a higher order asymptotic expansion up to third order accuracy in time and space, with a careful linearization technique. We first derive an error estimate in the lower order space and obtain a rough error estimate in . Then the error estimate combined with the inverse inequality yields a uniform bound on the error function, which implies the strict separation from pure states for the numerical solutions. This crucial fact enables us to achieve the refined estimate by using the energy method. In the last part of this paper, we present some numerical experiments in the two dimensional case with the PSD solver, which demonstrate the accuracy and robustness of the discrete scheme. Pearling bifurcation, meandering instability and spinodal decomposition are observed via the numerical simulation. The energy stability, mass conservation and the positivity preserving property are also verified numerically.
Acknowledgements
W. Chen was partially supported by NSFC 12241101 and NSFC 12071090. H. Wu was partially supported by NSFC 12071084 and the Shanghai Center for Mathematical Sciences at Fudan University. W. Chen and H. Wu are members of the Key Laboratory of Mathematics for Nonlinear Sciences (Fudan University), Ministry of Education of China.
References
- [1] J. W. Cahn, J. E. Hilliard, Free energy of a nonuniform system. I. interfacial free energy, The Journal of Chemical Physics 28 (2) (1958) 258–267.
- [2] S. Dai, K. Promislow, Geometric evolution of bilayers under the functionalized Cahn-Hilliard equation, Proc. Roy. Soc. A 469 (2013) 20120505, 20 pp.
- [3] Q. Du, C. Liu, X. Wang, A phase field approach in the numerical study of the elastic bending energy for vesicle membranes, J. Comput. Phys. 198 (2) (2004) 450–468.
- [4] Q. Du, C. Liu, R. Ryham, X. Wang, A phase field formulation of the Willmore problem, Nonlinearity 18 (3) (2005) 1249–1267.
- [5] S. Torabi, J. Lowengrub, A. Voigt, S. M. Wise, A new phase-field model for strongly anisotropic systems, Proc. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci. 465 (2105) (2009) 1337–1359, with supplementary material available online.
- [6] S. M. Wise, J. Kim, J. Lowengrub, Solving the regularized, strongly anisotropic Cahn-Hilliard equation by an adaptive nonlinear multigrid method, J. Comput. Phys. 226 (1) (2007) 414–446.
- [7] F. Chen, J. Shen, Efficient energy stable schemes with spectral discretization in space for anisotropic Cahn-Hilliard systems, Commun. Comput. Phys. 13 (5) (2013) 1189–1208.
- [8] G. Gompper, M. Schick, Correlation between structural and interfacial properties of amphiphilic systems, Phys. Rev. Lett. 65 (9) (1990) 1116–1119.
- [9] K. Promislow, B. Wetton, PEM fuel cells: a mathematical overview, SIAM J. Appl. Math. 70 (2) (2009) 369–409.
- [10] S. Dai, K. Promislow, Competitive geometric evolution of amphiphilic interfaces, SIAM J. Math. Anal. 47 (1) (2015) 347–380.
- [11] N. Gavish, G. Hayrapetyan, K. Promislow, L. Yang, Curvature driven flow of bi-layer interfaces, Phys. D 240 (7) (2011) 675–693.
- [12] A. Doelman, G. Hayrapetyan, K. Promislow, B. Wetton, Meander and pearling of single-curvature bilayer interfaces in the functionalized Cahn-Hilliard equation, SIAM J. Math. Anal. 46 (6) (2014) 3640–3677.
- [13] K. Promislow, Q. Wu, Existence of pearled patterns in the planar functionalized Cahn-Hilliard equation, J. Differential Equations 259 (7) (2015) 3298–3343.
- [14] J. Jones, Development of a fast and accurate time stepping scheme for the functionalized Cahn-Hilliard equation and application to a graphics processing unit, ProQuest LLC, Ann Arbor, MI, 2013, thesis (Ph.D.)–Michigan State University.
- [15] N. Kraitzman, K. Promislow, Pearling bifurcations in the strong functionalized Cahn-Hilliard free energy, SIAM J. Math. Anal. 50 (3) (2018) 3395–3426.
- [16] K. Promislow, Q. Wu, Existence, bifurcation, and geometric evolution of quasi-bilayers in the multicomponent functionalized Cahn-Hilliard equation, J. Math. Biol. 75 (2) (2017) 443–489.
- [17] K. Promislow, H. Zhang, Critical points of functionalized Lagrangians, Discrete Contin. Dyn. Syst. 33 (4) (2013) 1231–1246.
- [18] M. Doi, Soft Matter Physics, Oxford University Press, Oxford, UK, 2013.
- [19] A. Debussche, L. Dettori, On the Cahn-Hilliard equation with a logarithmic free energy, Nonlinear Anal. 24 (10) (1995) 1491–1514.
- [20] H. Wu, A review on the Cahn-Hilliard equation: classical results and recent advances in dynamic boundary conditions, Electron. Res. Arch. 30 (8) (2022) 2788–2832.
- [21] H. Abels, M. Wilke, Convergence to equilibrium for the Cahn-Hilliard equation with a logarithmic free energy, Nonlinear Anal. 67 (11) (2007) 3176–3193.
- [22] C. M. Elliott, H. Garcke, On the Cahn-Hilliard equation with degenerate mobility, SIAM J. Math. Anal. 27 (2) (1996) 404–423.
- [23] D. Li, A regularization-free approach to the Cahn-Hilliard equation with logarithmic potentials, Discrete Contin. Dyn. Syst. 42 (5) (2022) 2453–2460.
- [24] A. Miranville, S. Zelik, Robust exponential attractors for Cahn-Hilliard type equations with singular potentials, Math. Methods Appl. Sci. 27 (5) (2004) 545–582.
- [25] A. Giorgini, M. Grasselli, A. Miranville, The Cahn-Hilliard-Oono equation with singular potential, Math. Models Methods Appl. Sci. 27 (13) (2017) 2485–2510.
- [26] A. Giorgini, M. Grasselli, H. Wu, The Cahn-Hilliard-Hele-Shaw system with singular potential, Ann. Inst. H. Poincaré Anal. Non Linéaire 35 (4) (2018) 1079–1118.
- [27] L. Cherfils, A. Miranville, S. Zelik, The Cahn-Hilliard equation with logarithmic potentials, Milan J. Math. 79 (2) (2011) 561–596.
- [28] W. Chen, J. Jing, C. Wang, X. Wang, S. M. Wise, A modified Crank-Nicolson numerical scheme for the Flory-Huggins Cahn-Hilliard model., Commun. Comput. Phys. 31 (1) (2022) 60–93.
- [29] W. Chen, C. Wang, X. Wang, S. M. Wise, Positivity-preserving, energy stable numerical schemes for the Cahn-Hilliard equation with logarithmic potential, J. Comput. Phys. X 3 (2019) 100031, 29.
- [30] M. I. M. Copetti, C. M. Elliott, Numerical analysis of the Cahn-Hilliard equation with a logarithmic free energy, Numer. Math. 63 (1) (1992) 39–65.
- [31] D. Jeong, J. Kim, A practical numerical scheme for the ternary Cahn-Hilliard system with a logarithmic free energy, Phys. A 442 (2016) 510–522.
- [32] D. Jeong, S. Lee, J. Kim, An efficient numerical method for evolving microstructures with strong elastic inhomogeneity, Modelling Simul. Mater. Sci. Eng. 23 (4) (2015) Paper No. 045007.
- [33] H. Jia, Y. Li, G. Feng, K. Li, An efficient two-grid method for the Cahn-Hilliard equation with the concentration-dependent mobility and the logarithmic Flory-Huggins bulk potential, Appl. Math. Comput. 387 (2020) Paper No. 124548, 15 pp.
- [34] X. Li, Z. Qiao, H. Zhang, An unconditionally energy stable finite difference scheme for a stochastic Cahn-Hilliard equation, Sci. China Math. 59 (9) (2016) 1815–1834.
- [35] D. Li, T. Tang, Stability of the semi-implicit method for the Cahn-Hilliard equation with logarithmic potentials, Ann. Appl. Math. 37 (1) (2021) 31–60.
- [36] X. Yang, J. Zhao, On linear and unconditionally energy stable algorithms for variable mobility Cahn-Hilliard type equation with logarithmic Flory-Huggins potential, Commun. Comput. Phys. 25 (3) (2019) 703–728.
- [37] S. Dai, Q. Liu, K. Promislow, Weak solutions for the functionalized Cahn-Hilliard equation with degenerate mobility, Appl. Anal. 100 (2021) 1–16.
- [38] S. Dai, Q. Liu, T. Luong, K. Promislow, On nonnegative solutions for the functionalized C-ahn-Hilliard equation with degenerate mobility, Results Appl. Math. 12 (2021) Paper No. 100195, 13 pp.
- [39] K. Cheng, C. Wang, S. M. Wise, Z. Yuan, Global-in-time Gevrey regularity solutions for the functionalized Cahn-Hilliard equation, Discrete Cont. Dyn. Sys. Ser. S 13 (8) (2020) 2211–2229.
- [40] A. Miranville, Asymptotic behavior of a sixth-order Cahn–Hilliard system, Cent. Eur. J. Math. 12 (2014) 141–154.
- [41] N. Duan, Y. Cui, Z. X., A sixth-order phase-field equation with degenerate mobility, Bull. Malays. Math. Sci. Soc. 42 (2019) 79–103.
- [42] G. Schimperna, H. Wu, On a class of sixth-order Cahn-Hilliard-type equations with logarithmic potential, SIAM J. Math. Anal. 52 (5) (2020) 5155–5195.
- [43] A. Christlieb, J. Jones, K. Promislow, B. Wetton, M. Willoughby, High accuracy solutions to energy gradient flows from material science models, J. Comput. Phys. 257 (2014) 193–215.
- [44] R. Guo, Y. Xu, Z. Xu, Local discontinuous Galerkin methods for the functionalized Cahn-Hilliard equation, J. Sci. Comput. 63 (3) (2015) 913–937.
- [45] W. Feng, Z. Guan, J. Lowengrub, C. Wang, S. M. Wise, Y. Chen, A uniquely solvable, energy stable numerical scheme for the functionalized Cahn-Hilliard equation and its convergence analysis, J. Sci. Comput. 76 (3) (2018) 1938–1967.
- [46] C. Zhang, J. Ouyang, X. Wang, Y. Chai, M. Ma, Analysis of the energy stability for stabilized semi-implicit schemes of the functionalized Cahn-Hilliard mass-conserving gradient flow equation, J. Sci. Comput. 87 (1) (2021) Paper No. 34, 25.
- [47] C. Zhang, J. Ouyang, Unconditionally energy stable second-order numerical schemes for the functionalized Cahn-Hilliard gradient flow equation based on the SAV approach, Comput. Math. Appl. 84 (2021) 16–38.
- [48] C. Zhang, J. Ouyang, X. Wang, S. Li, J. Mao, Highly accurate, linear, and unconditionally energy stable large time-stepping schemes for the functionalized Cahn-Hilliard gradient flow equation, J. Comput. Appl. Math. 392 (2021) Paper No. 113479, 23 pp.
- [49] C. Zhang, J. Ouyang, C. Wang, S. M. Wise, Numerical comparison of modified-energy stable SAV-type schemes and classical BDF methods on benchmark problems for the functionalized Cahn-Hilliard equation, J. Comput. Phys. 423 (2020) 109772, 35.
- [50] G. Schimperna, I. Pawłow, On a class of Cahn-Hilliard models with nonlinear diffusion, SIAM J. Math. Anal. 45 (1) (2013) 31–63.
- [51] C. M. Elliott, A. M. Stuart, The global dynamics of discrete semilinear parabolic equations, SIAM J. Numer. Anal. 30 (6) (1993) 1622–1663.
- [52] D. J. Eyre, Unconditionally gradient stable time marching the Cahn-Hilliard equation, MRS Online Proceedings Library 529 (1998) 39–46.
- [53] L. Dong, C. Wang, H. Zhang, Z. Zhang, A positivity-preserving, energy stable and convergent numerical scheme for the Cahn-Hilliard equation with a Flory-Huggins-de Gennes energy, Commun. Math. Sci. 17 (4) (2019) 921–939.
- [54] L. Dong, C. Wang, H. Zhang, Z. Zhang, A positivity-preserving second-order BDF scheme for the Cahn-Hilliard equation with variable interfacial parameters, Commun. Comput. Phys. 28 (3) (2020) 967–998.
- [55] C. Liu, C. Wang, S. M. Wise, X. Yue, S. Zhou, A positivity-preserving, energy stable and convergent numerical scheme for the Poisson-Nernst-Planck system, Math. Comput. 90 (331) (2021) 2071–2106.
- [56] C. Liu, C. Wang, Y. Wang, A structure-preserving, operator splitting scheme for reaction-diffusion equations with detailed balance, J. Comput. Phys. 436 (2021) 110253.
- [57] J. Simon, Compact sets in the space , Ann. Mat. Pura Appl. 146 (4) (1987) 65–96.
- [58] S. M. Wise, Unconditionally stable finite difference, nonlinear multigrid simulation of the Cahn-Hilliard-Hele-Shaw system of equations, J. Sci. Comput. 44 (1) (2010) 38–68.
- [59] S. M. Wise, C. Wang, J. S. Lowengrub, An energy-stable and convergent finite-difference scheme for the phase field crystal equation, SIAM J. Numer. Anal. 47 (3) (2009) 2269–2288.
- [60] J. Guo, C. Wang, S. M. Wise, X. Yue, An convergence of a second-order convex-splitting, finite difference scheme for the three-dimensional Cahn-Hilliard equation, Commun. Math. Sci. 14 (2) (2016) 489–515.
- [61] C. Wang, S. M. Wise, An energy stable and convergent finite-difference scheme for the modified phase field crystal equation, SIAM J. Numer. Anal. 49 (3) (2011) 945–969.
- [62] H. O. Kreiss, J. Oliger, Stability of the Fourier method, SIAM J Numer. Anal. 16 (3) (1979) 421–433.
- [63] L. Wang, W. Chen, C. Wang, An energy-conserving second order numerical scheme for nonlinear hyperbolic equation with an exponential nonlinear term, J. Comput. Appl. Math. 280 (2015) 347–366.
- [64] X. Li, Z. Qiao, C. Wang, Convergence analysis for a stabilized linear semi-implicit numerical scheme for the nonlocal Cahn–Hilliard equation, Math. Comput. 90 (327) (2021) 171–188.
- [65] W. Chen, Q. Liu, J. Shen, Error estimates and blow-up analysis of a finite-element approximation for the parabolic-elliptic keller-segel system, arXiv preprint arXiv:2212.07655 (2022).
- [66] W. Feng, C. Wang, S. M. Wise, Z. Zhang, A second-order energy stable backward differentiation formula method for the epitaxial thin film equation with slope selection, Numer. Methods Partial Differential Eq. 34 (6) (2018) 1975–2007.
- [67] W. Feng, A. J. Salgado, C. Wang, S. M. Wise, Preconditioned steepest descent methods for some nonlinear elliptic equations involving -Laplacian terms, J. Comput. Phys. 334 (2017) 45–67.
- [68] J. Zhang, C. Wang, S. M. Wise, Z. Zhang, Structure-preserving, energy stable numerical schemes for a liquid thin film coarsening model, SIAM J. Sci. Comput. 43 (2) (2021) A1248–A1272.
- [69] N. Kraitzman, K. Promislow, An overview of network bifurcations in the functionalized Cahn-Hilliard free energy, in: Mathematics of energy and climate change, Vol. 2 of CIM Ser. Math. Sci., Springer, Cham, 2015, pp. 191–214.
- [70] S. Jain, F. S. Bates, On the origins of morphological complexity in block copolymer surfactants, Science 300 (5618) (2003) 460–464.