A posteriori error estimates for the Allen-Cahn problem
Konstantinos Chrysafinos, Emmanuil H. Georgoulis, Dimitra Plaka

TL;DR
This paper establishes a posteriori error estimates for fully-discrete Galerkin methods solving the Allen-Cahn equation, providing bounds that depend polynomially on the inverse interface length and improving existing error bounds.
Contribution
It introduces new a posteriori error estimates for the Allen-Cahn problem using spectral estimates and elliptic reconstruction, enhancing previous bounds in various norms.
Findings
Error estimates depend polynomially on inverse interface length
Spectral estimate for linearized operator is crucial
Improved bounds in $L_2(H^1)$ and $L_ extinfty(L_2)$ norms
Abstract
This work is concerned with the proof of \emph{a posteriori} error estimates for fully-discrete Galerkin approximations of the Allen-Cahn equation in two and three spatial dimensions. The numerical method comprises of the backward Euler method combined with conforming finite elements in space. For this method, we prove conditional type \emph{a posteriori} error estimates in the -norm that depend polynomially upon the inverse of the interface length . The derivation relies crucially on the availability of a spectral estimate for the linearized Allen-Cahn operator about the approximating solution in conjunction with a continuation argument and a variant of the elliptic reconstruction. The new analysis also appears to improve variants of known \emph{a posteriori} error bounds in , -norms in certain regimes.
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.
A posteriori error estimates
for the Allen-Cahn problem
Konstantinos Chrysafinos
(K. Chrysafinos) 1) Department of Mathematics, School of Mathematical and Physical Sciences, National Technical University of Athens, Zografou 15780, Greece and 2) IACM, FORTH, 20013 Heraklion, Crete, Greece.
,
Emmanuil H. Georgoulis
(E. H. Georgoulis) 1) Department of Mathematics, University of Leicester, Leicester LE1 7RH, UK, 2) Department of Mathematics, School of Mathematical and Physical Sciences, National Technical University of Athens, Zografou 15780, Greece and 3) IACM, FORTH, 20013 Heraklion, Crete, Greece.
and
Dimitra Plaka
(D. Plaka) Department of Mathematics, School of Mathematical and Physical Sciences, National Technical University of Athens, Zografou 15780, Greece.
Abstract.
This work is concerned with the proof of a posteriori error estimates for fully-discrete Galerkin approximations of the Allen-Cahn equation in two and three spatial dimensions. The numerical method comprises of the backward Euler method combined with conforming finite elements in space. For this method, we prove conditional type a posteriori error estimates in the -norm that depend polynomially upon the inverse of the interface length . The derivation relies crucially on the availability of a spectral estimate for the linearized Allen-Cahn operator about the approximating solution in conjunction with a continuation argument and a variant of the elliptic reconstruction. The new analysis also appears to improve variants of known a posteriori error bounds in , -norms in certain regimes.
1. Introduction
The Allen-Cahn problem comprises of a singularly perturbed parabolic semi-linear parabolic partial differential equation (PDE) together with suitable initial and boundary conditions, viz.,
[TABLE]
we assume that is a convex, polygonal () or polyhedral () domain of the Euclidean space , , , for sufficiently smooth initial condition and forcing function (precise regularity statements will be given below).
The problem (1) belongs to the class of the so-called phase field PDEs models for solidification of a pure material, originally introduced by Allen & Cahn [3] to describe the phase separation process of a binary alloy at a fixed temperature. The nonlinear function is the derivative of the classical double-well potential . Due to the nature of the non-linearity, the solution develops time-dependent interfaces , separating regions for which from regions where . The solution moves from one region to another within the, so-called, diffuse interfaces of length . For a recent comprehensive review of phase field models and their relationship to geometric flows, we refer to [12].
Realistically, should be orders of magnitude smaller than the physical domain of simulation. Therefore, the accurate and efficient numerical solution of such phase field models requires the resolution of the dynamic diffuse interfaces. This means that the discretisation parameters of any numerical method used should provide sufficient numerical resolution to approximate the interface evolution accurately. In the context of finite element methods, this is typically achieved via the use of very fine meshes in the vicinity of the interface region. In an effort to simulate at a tractable computational cost, especially for , it is essential to design adaptive algorithms which are able to dynamically modify the local mesh size.
A standard error analysis of finite element approximations of (1) leads to a priori estimates with unfavourable exponential dependence on . This is impractical even for moderately small interface length . The celebrated works [8, 10, 2] showed that uniform bounds for the principal eigenvalue of the linearized Allen-Cahn spatial operator about the solution are possible as long as the evolving interface is smooth (cf., (20) below). Such spectral estimates are used in the seminal work [14] whereby a priori error bounds with only polynomial dependence on for finite element methods have been proven, enabling also the proof of convergence to the sharp-interface limit. Moreover, assuming the validity of a spectral estimate about the exact solution , allowed the proof of the first conditional-type a posteriori error bounds for finite element methods approximating the Allen-Cahn problem in -norm, for which the condition depends only polynomially on ; this was presented in the influential works [18, 13].
This direction of research has taken a further leap forward with the seminal works [4, 6, 7], whereby the principle eigenvalue of the linearized spatial Allen-Cahn operator about the numerical solution is used instead, in an effort to arrive to fully computable a posteriori error estimates in - and -norms, the latter using the elliptic reconstruction framework [20, 19]. We also mention [16] whereby a posteriori error bounds in the -norms, are proven.
When the interface undergoes topological changes, however, e.g., when an interface collapses, unbounded velocities occur and the all-important principal eigenvalue can scale like on a time interval of length comparable to . This crucial observation, made in [7], showed that the principal eigenvalue can be assumed to be -integrable with respect to the time variable allowing, in turn, for robust conditional a posteriori error analysis under topological changes in - and -norms.
In a recent work [9], a priori bounds for the -norm error have been proved, which appear to deliver a rather favourable -polynomial dependence on the respective constant, noting that -norm is present in the stability of the spatial Allen-Cahn operator upon multiplication of (1) by and integration with respect to space and to time. An immediate question is whether proving conditional a posteriori error bounds in -norm norm can also improve the dependence of the condition on the interface length . Motivated by this, in this work, we prove conditional a posteriori error bounds for the -norm for a backward Euler-finite element method. The proof is valid under the hypothesis of the existence of a spectral estimate under topological changes in the spirit of [7]. The argument uses a carefully constructed test function, in conjunction with a continuation argument and a new variant of the elliptic reconstruction introduced in [15]. As a result of the method of proof, the new a posteriori error analysis provides also new - and -norm a posteriori error bounds which appear to, at least formally, be valid under less stringent smallness condition compared to results from the literature.
The remainder of this work is structured as follows. The model problem is introduced In Section 2. Section 3 include the definition of the numerical method along with the elliptic and time reconstructions needed for the proof of the main results. The key estimates and the main result are stated and proven in Section 4. Section 5 completes the derivation of fully computable error bounds by estimating the terms appearing in the residuals of the main results.
2. Model problem
We denote by , the standard Lebesgue spaces with corresponding norms . Let also is the th order of Sobolev space based on and , , along with the corresponding norms and , respectively. Set . We shall denote by the duality pairing between and , which becomes the standard inner product when the arguments are sufficiently smooth. The respective Bochner spaces are denoted by , endowed with the norms:
[TABLE]
with a Banach space with norm .
We shall make extensive use of the classical Gagliardo-Nirenberg-Ladyzhenskaya inequalities (GNL) reading:
[TABLE]
for all with , independent of . For later use, we also recall a basic algebraic estimate, often referred to as the Young’s inequality: for any , we have
[TABLE]
for any and , for some independent of .
Let and . Then, for a.e. , we seek , such that
[TABLE]
for all Integrating for , and integrating by parts the above becomes: find , such that
[TABLE]
for all .
3. The fully discrete scheme and reconstructions
We shall first present a fully discrete scheme for the Allen-Cahn problem (1) by combining the lowest order discontinuous Galerkin time-stepping method with conforming finite elements in space. Further, we shall define suitable space and time reconstructions of the fully discrete scheme, which will be crucial for the proof of the a posteriori error bounds below.
3.1. Discretisation
Let . We partition the time interval into subintervals and we denote by , each time step.
Let also be a sequence of conforming and shape-regular triangulations of the domain , that are allowed to be modified between time steps. We define the meshsize function, , by , for . To each we associate the finite element space:
[TABLE]
with denoting the -variate space of polynomials of degree at most . The whole theory presented below remains valid if box-type elements are used and respective polynomial spaces of degree on each variable.
We say that a set of triangulations is compatible when they are constructed by different refinements of the same (coarser) triangulation. Given two compatible triangulations and , we consider their finest common coarsening and set . The partial order relation among the triangulations implies that . Furthermore, we denote by the interior mesh skeleton of , and we define the sets and
Approximations will be subordinate to the time partition. A finite element space is specified on each time interval , . Then, we seek approximate solutions from the space
[TABLE]
with \mathbb{P}_{0}\big{[}J_{n};V_{h}\big{]} denoting the space of constant polynomials over , having values in ; these functions are allowed to be discontinuous at the nodal points, but are taken to be continuous from the left.
3.2. Fully discrete scheme
For brevity, we set . The backward Euler-finite element method reads: for each , find , such that
[TABLE]
for every , with and denoting the orthogonal -projection operator onto .
Let now defined by , for all , i.e., the discrete Laplacian. This allows for the strong representation of (6) as
[TABLE]
We now introduce a variant of the elliptic reconstruction [20, 19, 15], which will be instrumental in the proof of the a posteriori error bounds below.
Definition 3.1** (elliptic reconstruction).**
For each we define the elliptic reconstruction to be the solution of the elliptic problem
[TABLE]
where
[TABLE]
Remark 3.2* (Galerkin orthogonality).*
We observe that satisfies
[TABLE]
This relation implies that is orthogonal to with respect to the Dirichlet inner product, a crucial property that allows to use a posteriori error bounds for elliptic problems to estimate various norms of from above; we refer to Section 5 for a detailed discussion.
Definition 3.3** (time reconstruction).**
For , , we set
[TABLE]
where the piecewise linear Lagrange basis function with .
The above definition implies that the time derivative of ,
[TABLE]
is the discrete backward difference at .
4. A posteriori error estimates
We shall now use the reconstructions defined above, together with non-standard energy and continuation arguments and a spectral estimate for the linearized steady-state problem about the approximate solution , to arrive at a posteriori error bounds in the -, - and -norms.
4.1. Error relation
We begin by splitting the total error as follows:
[TABLE]
In view of Remark 3.2, can be estimated by a posteriori error bounds for elliptic problems in various norms.
Also, satisfies an equation of the form (4) with a fully computable right-hand side that consists of and the problem data. To see this, (4) along with Definitions 3.1 and 3.3 and elementary manipulations lead to the following result.
Lemma 4.1** (error equation).**
On , and for all , we have
[TABLE]
Therefore, norms of can be estimated through PDE stability arguments; this will be performed below. Before doing so, however, we further estimate the term involving the elliptic reconstructions on the right-hand side from (14).
Lemma 4.2**.**
On , , we have
[TABLE]
for all .
Proof.
From (11) and Definition 3.1, we can write
[TABLE]
Then, using (9) in conjunction with (7), we obtain
[TABLE]
and correspondingly for . Combining the above, the result already follows. ∎
4.2. Energy argument
We begin by introducing some notation. We define
[TABLE]
on each , , noting that ; for we adopt the convention that .
Moreover, for brevity, we also set
[TABLE]
[TABLE]
where , , , where is the constant of the Poincaré-Friedrichs inequality and as in (2).
Lemma 4.3** ().**
Let and be the solution of (4) and as in (11). Assume that for a.e. . Then, for any , we have
[TABLE]
where
[TABLE]
Proof.
Using Taylor’s theorem, we immediately deduce
[TABLE]
Let , φορ , such that
[TABLE]
Hypothesis implies that . Setting in (14), we have
[TABLE]
Observing now the identities
[TABLE]
elementary calculations yield
[TABLE]
We shall further estimate each . We begin by splitting into
[TABLE]
Applying Hölder, GNL for , Poincaré-Friedrichs and Young inequalities gives, respectively,
[TABLE]
The Cauchy-Schwarz and Young inequalities also yield Likewise, we split as follows:
[TABLE]
yielding the following bounds
[TABLE]
From Lemma 4.2 and working as before, we have
[TABLE]
[TABLE]
Next, we split as follows:
[TABLE]
and, using Hölder, Poincaré-Friedrichs and Young inequalities, we deduce
[TABLE]
Next, we split
[TABLE]
which can be further bounded as follows:
[TABLE]
In the same spirit, we also have
[TABLE]
and, thus,
[TABLE]
Next, we consider the splitting
[TABLE]
and we have the following bounds:
[TABLE]
Next, we set
[TABLE]
and we further estimate as follows:
[TABLE]
For and , we work collectively as follows:
[TABLE]
and estimate:
[TABLE]
Finally for the last term on the right-hand side of (18), we have
[TABLE]
Applying the above estimates into (18) and integrating with respect to and observing the identities
[TABLE]
along with elementary manipulations, the result already follows. ∎
The use of the dimension-dependent GNL inequalities (2) necessitates certain modifications in the above argument when , which we now provide. For brevity, we shall only provide the terms which are handled differently to the proof of the two-dimensional case from Lemma 4.3.
Lemma 4.4** ().**
Let , the solution of (4) and as in (11). Assume that for a.e. . Then, for any , we have
[TABLE]
where
[TABLE]
with , , .
Proof.
Starting from (18), we discuss only the different treatment of the terms , ; the estimation of the remaining terms is identical to the proof of Lemma 4.3 and is, therefore, omitted. To that end, we begin by setting . Then, we have
[TABLE]
using (2) for . Similarly, we have
[TABLE]
Likewise, using completely analogous arguments, we have
[TABLE]
The estimation of the remaining on the right-hand of (18) are completely analogous to the two-dimensional case with the difference that one applies (2) for . Collecting all the estimates, we arrive at the desirable result. ∎
Remark 4.5*.*
In the a posteriori error estimation literature for evolution problems, and the term of are often referred to as the time error estimates, while is the data approximation. represents the mesh change and (or , respectively) is often termed as the spatial error estimate. These will be presented in detail in Section 5.
Remark 4.6*.*
We stress that the above result remains valid for the case of Neumann boundary conditions, upon modifying slightly the definition of the elliptic reconstruction (8) to eliminate the undetermined mode. Moreover, this can be done in such a way to recover (2) for terms involving . This is not done here in the interest of simplicity of the presentation only.
4.3. Spectral estimates
To ensure polynomial dependence of the resulting estimates on , a widely used idea is to employ spectral estimates of the principal eigenvalue of the linearized Allen-Cahn operator:
[TABLE]
The celebrated works [8, 10, 2] showed that can be bounded independently of for the case of smooth, evolved interfaces. This idea was used in the seminal works [14] for the proof of a priori and [18, 13] for a posteriori error bounds for finite element methods in various norms with constants depending upon only in a polynomial fashion. The a priori nature of the spectral estimate (20) is somewhat at odds, however, with the presence of in a posteriori error bounds. This difficulty was overcome in the seminal work [4] by first linearizing about the numerical solution , viz.,
[TABLE]
and by then proving verifiable eigenvalue approximation error bounds. The latter ensure that it is possible to compute principle eigenvalue approximations , such that ; we refer to [4, Section 5] for the detailed construction. In short, it has been shown that for linear conforming finite element spaces, (,) it is possible to construct for almost all upon assuming that remains bounded independently of .
The -independence , (resp. , ,) however, is not guaranteed when the evolving interfaces are subjected to topological changes. This is an important challenge, since phase-field approaches are preferred over sharp-interface models exactly due to their ability evolve interfaces past topological changes. To address this, in [7] (cf., also [5, 6]) a crucial observation on the temporal integrability of under topological changes was given: during topological changes we have , but only for time periods of length . Therefore, it has been postulated that there exists an , such that
[TABLE]
holds for some constant independent of , for some ; notice that for , we return to the earlier case of no topological changes. A number of numerically validated scenarios justifying (22) for the scalar Allen-Cahn and its vectorial counterpart, the Ginzburg-Landau equation, can be found in [7]. Moreover, a construction for a such that
[TABLE]
has been provided in [7, Proposition 3.8].
The above motivate the following assumption on the behaviour of the principal eigenvalue , which we shall henceofrth adopt.
Assumption 4.7**.**
We postulate the validity of one of the following options:
- (I)
we assume that the zero level set is sufficiently smooth. Then, for almost every , there exists a computable bound which is independent of .
- (II)
there exists an , such that for some constant independent of and we can construct a such that (23) holds.
Of course, Assumption 4.7(I) is a special case of Assumption 4.7(II), arising when . Nonetheless, when Assumption 4.7(I) is valid, the resulting a posteriori error estimates will have more favourable dependence on the final time than the estimates that are possible under the more general Assumption 4.7(II).
We shall prove a posteriori error estimates under the more general Assumption 4.7(II), commenting, nevertheless, on the differences that would arise in the proof under 4.7(I) instead.
4.4. Continuation argument
We begin by noting that, compared to the state-of-the-art estimates of [7, 6], there are three additional terms on the right hand side of (16), (19), due to the use of the special test function (17): and which arise naturally and are symmetric with respect to the norm that is to be estimated, while the additional term can be compensated by the presence of the additional terms (weighted norms) appearing on the left-hand side. Since the -norm does not arise naturally in the Allen-Cahn energy functions, we have opted in dropping the terms in the analysis below.
Assuming that is available, we set in (21), to deduce
[TABLE]
For , we work as follows. Upon setting
[TABLE]
and we use (24) on the left-hand side of (16), we note that , and ignore , to arrive at
[TABLE]
where .
Now, we set and, for , we use the abbreviation
[TABLE]
for the collection of semi-norms on the left-hand side of the last estimate. With this notation, we define the set
[TABLE]
The set is non-empty because and the left-hand side depends continuously on . We set , and we assume that ; we aim to arrive at a contradiction. Hence, using the definition of the set , we deduce
[TABLE]
If the last term on the right-hand side of the last estimate is bounded above by , or, equivalently, if it holds
[TABLE]
then for all we have
[TABLE]
Since , Grönwall’s Lemma implies
[TABLE]
upon setting . This contradicts the hypothesis and, therefore, proves that .
Likewise for , we insert the spectral estimate (24) into (19), and we work as for . Setting
[TABLE]
and , through the same argumentation, we conclude that now the set equals upon assuming the condition
[TABLE]
The above argument has already confirmed the validity of the following result.
Lemma 4.8**.**
Assume that (25) holds when when or (26) holds when . Then, we have the bound
[TABLE]
4.5. Main results
Now we are ready to present the main error estimate in the -norm, from which we can easily arrived at a fully computable a posteriori estimate in Section 5.
Theorem 4.9**.**
Let and , , . Let be the solution of (4) and is its approximation (6). Then, under Assumption (4.7)(II)* and the condition*
[TABLE]
the following error bound holds
[TABLE]
Proof.
Ignoring nonnegative terms on the left-hand side of (27), we have
[TABLE]
the proof follows by a triangle inequality. ∎
Remark 4.10*.*
Under the more restrictive Assumption 4.7(I), the continuation argument presented in Section 4.4 remains analogous with minor alterations. Specifically, if we set and we replace by and by , with , Theorem 4.9 remains valid.
Remark 4.11*.*
We stress that Theorem 4.9 holds also in cases whereby it is not possible to assume that is bounded independently of . We note, however, that remains uniformly bounded with respect to and the mesh parameters in all scenarios of practical interest we are aware of and it is typically required in scenarios ensuring the validity of Assumption 4.7.
It is instructive to discuss in detail the dependence of the various terms appearing in (28) and (29) to assess the practicality of the resulting a posteriori error bound below. The computational challenge for is manifested by the satisfaction of the condition (28). Indeed as the condition (28) becomes increasingly more stringent to be satisfied, necessitating meshes to be increasingly locally fine enough so as to reduce the estimator ; this results to proliferation of the numerical degrees of freedom. Once is small enough, an adaptive algorithm could make use of Theorem 4.9 for further estimation, which requires (28) to be valid.
Assume for argument’s sake that for all for some -independent constant . Also, we have
[TABLE]
The -norm of each will be further estimated in Section 5. For the moment, if also assume that uniformly with respect to , then we can conclude that , and, therefore,
[TABLE]
for some generic constants , independent of , upon noting that .
Moreover, in the case of smooth developed interfaces (Assumption 4.7(I)), one expects that as highlighted in the classical works [8, 10]. When topological changes take place, we can follow [7] and postulate that , . With the above convention, we find that (28) becomes
[TABLE]
for some constant for all , thus encapsulating simultaneously both cases of Assumption 4.7.
Hence, the -dependence for the condition (28) appears to be less stringent than in the respective conditional a posteriori in - and -norms from [4, 7, 6], which reads, roughly speaking, for the corresponding estimator and some constant . Therefore, seeking to prove a posteriori error estimates for the -norm error is, in our view, justified, as they can be potentially used to drive space-time adaptive algorithms without excessive numerical degree of freedom proliferation. This is an significant undertaking in its own right and will be considered in detail elsewhere.
The new a posteriori error analysis appears to also improve the -dependence on the condition for - and -norm bounds compared to [13, 4, 7, 6] in certain cases. Of course, the different method of proof above results to different terms appearing in above compared to the respective conditional a posteriori error bounds from [13, 4, 7, 6]. Therefore, the performance of the proposed estimates above has to be assessed numerically before any conclusive statements can made. In particular, we have the following result.
Proposition 4.12** (- and -norm estimates).**
With the hypotheses of Theorem 4.9 and, assuming condition (28), we have the bounds
[TABLE]
Therefore, in the same setting as before, we have (28) implies
[TABLE]
If we accept that from [4, 7, 6], for the sake of the argument, at least at the level of the conditional estimate, (28) gives formally favourable dependence on when and and also when and , compared to the respective dependence from [7, 6].
5. Fully computable upper bound
The bound in Theorem 4.9 is still not fully computable, due various terms involving and , which we shall now further estimate by computable quantities.
5.1. Initial condition estimates
For the terms involving , we have
[TABLE]
The Sobolev norms of appearing on can be further estimated by a posteriori bounds for elliptic problems; see, e.g., [22, 1]. We focus, therefore, in the derivation of -norm a posteriori error bounds for elliptic problems for and for via suitable duality arguments. Although the derivation is somewhat standard, we prefer to present it here with some level of detail to highlight the regularity assumptions required. Specifically, consider the dual problem:
[TABLE]
on an convex domain. Then, there exists a constant , depending on the domain , such that
[TABLE]
we refer to [17] for details.
5.2. Spatial error estimates
We shall estimate by residual-type estimators due to the presence of non-Hilbertian norms. In view of Remark 3.2 above, is the error of the elliptic problem (8), so we can further estimate norms of once we have estimators of the form
[TABLE]
at our disposal for . Therefore, from (11) we have
[TABLE]
giving
[TABLE]
for an algebraic constant.
Let . To determine the estimator precisely, we set on (30) and we have
[TABLE]
from Remark 3.2, with denoting the standard Scott-Zhang interpolation operator that satisfies optimal approximation properties [21]. Continuing in standard fashion, we have
[TABLE]
with , for some constant independent of and of the functions involves, using the approximation properties of ; here is the jump across the internal edge . Then, the elliptic regularity estimate (31) implies that
[TABLE]
the element residual at time .
For the limiting case , we can take
[TABLE]
with , where and ; we refer to [11] for details.
5.3. Mesh change estimates
The general strategy of time extensions in (11), (12) consists in decomposing as follows
[TABLE]
with , . Since in general, we define the Scott-Zang interpolation operator relative to the finest common coarsening of and . The latter allows to apply the Galerkin orthogonality property of the elliptic reconstruction in . Moreover, we have the following approximation result: for all and it holds that
[TABLE]
where , with denoting the neighbourhood of elements sharing the face , where, as before, the positive constant depends only on the shape regularity of the triangulation.
Setting on (30), we work as before to deduce
[TABLE]
with denoting the finite element space subordinate to the coarsest common refinement of and and for some sequence . Standard estimation via Hölder’s inequality and (34) give, in turn,
[TABLE]
Finally, the assumed elliptic regularity (31), gives the a posteriori error estimator
[TABLE]
for which we have .
Aknowledgments
EHG acknowledges the financial support of The Leverhulme Trust via a research project grant (grant no. RPG-2015-306). DP acknowledges the financial support of the Stavros Niarchos Foundation within the framework of project ARCHERS.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Ainsworth and J. T. Oden , A posteriori error estimation in finite element analysis , John Wiley & Sons, Inc., 2000.
- 2[2] N. Alikakos and G. Fusco , The spectrum of the Cahn–Hilliard operator for generic interface in higher space dimensions , Indiana Univ. math. J., 42 (1993), pp. pp. 637–674.
- 3[3] S. M. Allen and J. W. Cahn , A microscopic theory for antiphase boundary motion and its application to antiphase domain coarsening , Acta Metall., 27 (1979), pp. pp. 1085–1095.
- 4[4] S. Bartels , A posteriori error analysis for time-dependent Ginzburg–Landau type equations , Numer. Math., 99 (2005), pp. pp. 557–583.
- 5[5] S. Bartels , Numerical Approximation of Partial Differential Equations , Springer, 2016.
- 6[6] S. Bartels and R. Müller , Quasi-optimal and robust a posteriori error estimates in L ∞ ( L 2 ) superscript 𝐿 superscript 𝐿 2 {L}^{\infty}({L}^{2}) for the approximation of Allen–Cahn equations past singularities , Math. Comput., 80 (2011), pp. pp. 761–780.
- 7[7] S. Bartels, R. Müller, and C. Ortner , Robust a priori and a posteriori error analysis for the approximation of Allen–Cahn and Ginzburg–Landau equations past topological changes , SIAM J. Numer. Anal., 49 (2011), pp. pp. 110–134.
- 8[8] X. Chen , Spectrum for the Allen–Chan, Chan–Hillard, and phase-field equations for generic interfaces , Comm. PD Es, 19 (1994), pp. pp. 1371–1395.
