Abstract
The mathematical description of phase separation and melting processes is often based on phase field models. These descriptions define a phase field variable that specifies particular phases as the solution of a semilinear parabolic partial differential equation. A small parameter that defines the width of the interfaces between different phases enters classical stability estimates in a critical way, and refined arguments are required to improve this dependence. Applying those estimates to analyzing approximation schemes for the simplest case of the Allen–Cahn equation in terms of a priori and a posteriori error estimates is carried out. The stability of various implicit and semi-implicit time-stepping schemes is discussed.
Access provided by Autonomous University of Puebla. Download chapter PDF
Keywords
- Allen-Cahn Equation
- Semilinear Parabolic Partial Differential Equations
- Posteriori Error Estimates
- Semi-implicit Euler Scheme
- Mean Curvature flow
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
1 Analytical Properties
The Allen–Cahn equation is a simple mathematical model for certain phase separation processes. It also serves as a prototypical example for semilinear parabolic partial differential equations. The presence of a small parameter that defines the thickness of interfaces separating different phases makes the analysis challenging. Given \(u_0\in L^2(\varOmega )\), \(\varepsilon >0\) and \(T>0\), we seek a function \(u:{[0,T]}\times \varOmega \rightarrow \mathbb {R}\) that solves
for almost every \(t\in {[0,T]}\) and with \(f= F'\) for a nonnegative function \(F\in C^1(\mathbb {R})\) satisfying \(F(\pm 1)=0\), cf. Fig. 6.1. Unless otherwise stated, we always consider \(F(s)=(s^2-1)^2/4\) and \(f(s)= s^3-s\) but other choices are possible as well. We always assume that \(|u_0(x)|\le 1\) for almost every \(x\in \varOmega \). For this model problem we will discuss aspects of its numerical approximation. For further details on modeling aspects and the analytical properties of the Allen–Cahn and other phase-field equations we refer the reader to the textbook [7] and the articles [1, 2, 4, 6, 10, 11].
The Allen–Cahn equation is the \(L^2\)-gradient flow of the functional
Solutions tend to decrease the energy and develop interfaces separating regions in which it is nearly constant with values close to the minima of \(F\). We refer to the zero level set of the function \(u\) as the interface but note that this does not define a sharp separation of the phases. More precisely, the phases are separated by a region of width \(\varepsilon \) around the zero level set of \(u\) often called the diffuse interface.
1.1 Existence and Regularity
The existence of a unique solution \(u\) follows, e.g., from a discretization in time and a subsequent passage to a limit.
Theorem 6.1
(Existence) For every \(u_0\in L^2(\varOmega )\) and \(T>0\) there exists a weak solution \(u\in H^1({[0,T]};H^1(\varOmega )')\cap L^2({[0,T]};H^1(\varOmega ))\) that satisfies \(u(0)=u_0\) and
for almost every \(t\in {[0,T]}\) and every \(v\in H^1(\varOmega )\). If \(u_0\in H^1(\varOmega )\), then we have \(u\in H^1({[0,T]};L^2(\varOmega )) \cap L^\infty ({[0,T]};H^1(\varOmega ))\) and
for almost every \(T'\in {[0,T]}\).
Proof
The existence of a solution follows from an implicit discretization in time that leads to a sequence of well-posed minimization problems. Straightforward a-priori bounds, together with compact embeddings, then show the existence of a weak limit that solves the weak formulation. If \(u_0\in H^1(\varOmega )\), then we may formally choose \(v=\partial _t u\) to verify that
An integration over \({[0,T]}\) implies the asserted bound. This procedure can be rigorously carried out for a time-discretized problem, and then the estimate also holds as the time-step size tends to zero. \(\square \)
Remarks 6.1
(i) Stationary states for the Allen–Cahn equation are the constant functions \(u\equiv \pm 1\) and \(u\equiv 0\). The state \(u\equiv 0\) is unstable.
(ii) For \(\varOmega =\mathbb {R}^d\) a stationary solution is given by \(u(x) = \tanh (x\cdot a/ (\sqrt{2}\varepsilon ))\) for all \(x\in \mathbb {R}^d\) and an arbitrary vector \(a\in \mathbb {R}^d\). This characterizes the profile of typical solutions for Allen–Cahn equations across interfaces.
Since the nonlinearity \(f\) is monotone outside the interval \([-1,1]\), solutions of the Allen–Cahn equation satisfy a maximum principle.
Proposition 6.1
(Maximum principle and uniqueness) If \(u\) is a weak solution of the Allen–Cahn equation and \(|u_0(x)|\le 1\) for almost every \(x\in \varOmega \), then \(|u(t,x)|\le 1\) for almost every \((t,x)\in {[0,T]}\times \varOmega \). Solutions with this property are unique.
Proof
Let \(\widetilde{u}\in H^1({[0,T]};H^1(\varOmega )')\cap L^2({[0,T]};H^1(\varOmega ))\) be the function obtained by truncating \(u\) at \(\pm 1\), i.e.,
for almost every \((t,x)\in {[0,T]}\times \varOmega \). Then \(\partial _t \widetilde{u}= \partial _t u\), \(\nabla \widetilde{u}= \nabla u\), and \(f(\widetilde{u})=f(u)\) in \(\{ (t,x)\in {[0,T]}\times \varOmega : |\widetilde{u}(t,x)|<1\}\) and \(\partial _t \widetilde{u}=0\), \(\nabla \widetilde{u}=0\), and \(f(\widetilde{u})=0\) otherwise. The function \(\widetilde{u}\) is therefore a weak solution of the Allen–Cahn equation. If \(u-\widetilde{u}\ne 0\), then either \(u\ge \widetilde{u}= 1\) and
or \(u\le \widetilde{u}= -1\) and
Altogether we find that almost everywhere in \({[0,T]}\times \varOmega \), we have
The difference \(\delta = u-\widetilde{u}\) satisfies
and for \(v=\delta \), we obtain
With \(\delta (0)=0\), it follows directly that \(\delta =0\) in \({[0,T]}\times \varOmega \). If \(u_1\) and \(u_2\) are solutions with \(|u_1|,|u_2| \le 1\) in \({[0,T]}\times \varOmega \), then we have
almost everywhere in \({[0,T]}\times \varOmega \) with \(c_f = \sup _{s\in [-1,1]} |f'(s)|\). The difference \(\delta = u_1-u_2\) satisfies
and the choice of \(v=\delta \) leads to
An application of Gronwall’s lemma implies that \(u_1=u_2\). \(\square \)
As for the linear heat equation, one can show that the solution is regular. The corresponding bounds depend critically however on the small parameter \(\varepsilon >0\).
Theorem 6.2
(Regularity) If the Laplace operator is \(H^2\) regular in \(\varOmega \) and \(u_0\in H^1(\varOmega )\), then \(u\in L^\infty ({[0,T]};H^2(\varOmega ))\cap H^2({[0,T]};H^1(\varOmega )')\cap H^1({[0,T]};H^2(\varOmega ))\) and there exists \(\sigma \ge 0\) such that
If \(I_\varepsilon (u_0)\le c\) and \(\Vert \Delta u_0\Vert \le c \varepsilon ^{-2}\), then we may choose \(\sigma =2\).
Proof
The proof follows with the arguments that are used to prove the corresponding statements for the linear heat equation, cf. [8]. \(\square \)
1.2 Stability Estimates
In the following stability result we assume that an approximate solution satisfies a maximum principle. This is satisfied for certain numerical approximations and the assumption can be weakened to a uniform \(L^\infty \)-bound. We recall that Gronwall’s lemma states that if a nonnegative function \(y\in C({[0,T]})\) satisfies
for all \(T'\in {[0,T]}\) with a nonnegative function \(a\in L^1({[0,T]})\), then we have
Together with a Lipschitz estimate, this will be the main ingredient for the following stability result. Due to its exponential dependence on \(\varepsilon ^{-2}\), it is of limited practical use.
Theorem 6.3
(Stability) Let \(u\in H^1({[0,T]};H^1(\varOmega )')\cap L^\infty ({[0,T]};H^1(\varOmega ))\) be a weak solution of the Allen–Cahn equation with \(|u|\le 1\) almost everywhere in \({[0,T]}\times \varOmega \). Let \(\widetilde{u}\in H^1({[0,T]};H^1(\varOmega )')\cap L^2({[0,T]};H^1(\varOmega ))\) satisfy \(|\widetilde{u}|\le 1\) almost everywhere in \({[0,T]}\times \varOmega \), and \(\widetilde{u}(0) = \widetilde{u}_0\), and solve
for almost every \(t\in {[0,T]}\), all \(v\in H^1(\varOmega )\), with a functional \(\widetilde{\fancyscript{R}}\in L^2({[0,T]};H^1(\varOmega )')\). Then we have
Proof
With \(c_f = \sup _{s\in B_1(0)} |f'(s)|\), we have
for all \(s_1,s_2\in \mathbb {R}\). The difference \(\delta = u-\widetilde{u}\) satisfies
for almost every \(t\in I\) and every \(v\in H^1(\varOmega )\). For \(v=\delta \) we find that
Absorbing the term \(\Vert \nabla \delta \Vert ^2/2\) on the left-hand side and integrating over \((0,T')\) lead to
Defining \(A= \Vert \delta (0)\Vert ^2 + \int _0^T \Vert \widetilde{\fancyscript{R}}\Vert _{H^1(\varOmega )'}^2 \,{\mathrm d}t\), \(b= (1+2c_f\varepsilon ^{-2})\), and setting
we have \(y(T') \le A + a \int _0^{T'} y(t)\,{\mathrm d}t\); Gronwall’s lemma implies the estimate of the theorem. \(\square \)
Remark 6.2
The functional \(\widetilde{\fancyscript{R}}\) models the error introduced by a discretization of the equation so that we may assume that \(\Vert \widetilde{\fancyscript{R}}(t)\Vert _{H^1(\varOmega )'}^2 \le c \varepsilon ^{-\rho }(h^\alpha + \tau ^\beta )\) for a mesh-size \(h>0\) and a time-step size \(\tau >0\), and parameters \(\alpha ,\beta ,\rho >0\). If \(\Vert u_0-\widetilde{u}_0\Vert ^2\le h^\gamma \), then we obtain the error estimate
Even for the moderate choice \(\varepsilon \approx 10^{-1}\), the exponential factor is of the order \(10^{40}\) and it is impossible to compensate this factor with small mesh- and time-step sizes to obtain a useful error estimate. In practice even smaller values of \(\varepsilon \) are relevant.
To obtain an error estimate that does not depend exponentially on \(\varepsilon ^{-1}\) and which holds without assuming a maximum principle, refined arguments are necessary. The following generalization of Gronwall’s lemma allows us to consider a superlinear term.
Proposition 6.2
(Generalized Gronwall lemma) Suppose that the nonnegative functions \(y_1\in C({[0,T]})\), \(y_2,y_3 \in L^1({[0,T]})\), \(a\in L^\infty ({[0,T]})\), and the real number \(A\ge 0\) satisfy
for all \(T'\in {[0,T]}\). Assume that for \(B \ge 0\), \(\beta >0\), and every \(T'\in {[0,T]}\), we have
Set \(E =\exp \big (\int _0^T a(t)\,{\mathrm d}t\big )\) and assume that \(8AE \le (8 B (1+T)E )^{-1/\beta }\). We then have
Proof
We assume first that \(A>0\), set \(\theta =8AE\), and define
Since \(y_1(0)\le A<\theta \) and since \(\varUpsilon \) is continuous and increasing, we have \(I_\theta = [0,T_M]\) for some \(0< T_M\le T\). For every \(T'\in [0,T_M]\) we have
An application of the classical Gronwall lemma, the condition on \(A\), and the choice of \(\theta \) yield that for all \(T'\in [0,T_M]\), we have
This implies \(\varUpsilon (T_M)<\theta \), hence \(T_M=T\), and thus proves the lemma if \(A>0\). The argument is illustrated in Fig. 6.2. If \(A=0\), then the above argument holds for every \(\theta >0\) and we deduce that \(y_1(t)=y_2(t)=0\) for all \(t\in {[0,T]}\). \(\square \)
Remark 6.3
The differential equation underlying the generalized Gronwall lemma has the structure \(y'=y^{1+\beta }\). For \(\beta >0\), solutions become unbounded in finite time depending on the initial data, e.g., for \(y'=y^2\), we have \(y(t)=(t_c-t)^{-1}\) with \(t_c= y_0^{-1}\). Therefore, an assumption on \(A\) is unavoidable to obtain an estimate on the entire interval \({[0,T]}\).
Two elementary properties of the function \(f\) are essential for an improved stability result. These define a class of nonlinearities that can be treated with the same arguments.
Lemma 6.1
(Controlled non-monotonicity) We have \(f'(s)\ge -1\) and
for all \(r,s\in \mathbb {R}\).
Proof
The lemma follows from the identities \(f'(s)=3s^2-1\), \(f''(s) = 6s\), and \(f'''(s) = 6\) together with a Taylor expansion of \(f\). \(\square \)
The controlled non-monotonicity of \(f\) avoids the use of a Lipschitz estimate. To estimate the resulting term involving \(f'\), we employ the smallest eigenvalue of the linearization of the mapping \(u\mapsto -\Delta u + f(u(t))\), i.e., of the linear operator \(v\mapsto -\Delta v + f'(u(t))v\).
Definition 6.1
For \(u\in L^\infty ({[0,T]};H^1(\varOmega ))\) let the principal eigenvalue \(\lambda _\mathrm{AC}{:}\,{[0,T]}\rightarrow \mathbb {R}\) of the linearized Allen–Cahn operator for \(t\in {[0,T]}\) be defined by
Remarks 6.4
(i) As in the theory of ordinary differential equations, the principal eigenvalue contains information about the stability of the evolution.
(ii) If \(|u(t)|\le 1\) in \(\varOmega \), then we have \(-\lambda _\mathrm{AC}(t)\ge c_P^2 -1-c_f \varepsilon ^{-2}\) with the Poincaré constant \(c_P = \sup _{v\in H^1(\varOmega )\setminus \{0\}} \Vert v\Vert /\Vert v\Vert _{H^1(\varOmega )}\) and \(c_f = \sup _{s\in [-1,1]} |f'(s)|\). Therefore, \(\lambda _\mathrm{AC}(t)\le 1+\varepsilon ^{-2}\). The evolution is stable as long as \(\lambda _\mathrm{AC}(t)\le c\) for an \(\varepsilon \)-independent constant \(c>0\), and becomes unstable for \(\lambda _\mathrm{AC}(t) \gg 1\).
(iii) For the stable stationary states \(u(t)\equiv \pm 1\), the choice of \(v\equiv 1\) shows that we have \(\lambda _\mathrm{AC}(t) = -2\varepsilon ^{-2}\le 0\), while for the unstable stationary state \(u(t)\equiv 0\) we have \(\lambda _\mathrm{AC}(t) = \varepsilon ^{-2}\).
(iv) As long as the curvature of the interface \(\varGamma _t = \{x\in \varOmega : u(t,x)=0\}\) is bounded \(\varepsilon \)-independently, one can show that \(\lambda _\mathrm{AC}(t)\) is bounded \(\varepsilon \)-independently, cf. [4].
The generalized Gronwall lemma, the controlled non-monotonicity, and the principal eigenvalue \(\lambda _\mathrm{AC}\) can be used for an improved stability analysis. We first use the non-monotonicity in the equation for the difference \(\delta =u-\widetilde{u}\) tested by \(\delta \), i.e.,
The definition of \(\lambda _\mathrm{AC}(t)\) implies that
and the combination of the two estimates proves that
By slightly refining the argument we may apply the generalized Gronwall lemma to this equation. In the following theorem we employ the principal eigenvalue defined by an approximate solution to the Allen–Cahn equation. This is in the spirit of a posteriori error estimation to obtain a computable bound for the approximation error. It follows the concept that all information about the problem is extracted from the approximate solution.
Theorem 6.4
(Robust stability) Let \(0<\varepsilon \le 1\) and \( u\in H^1({[0,T]};H^1(\varOmega )')\cap L^2({[0,T]};H^1(\varOmega ))\) be the weak solution of the Allen–Cahn equation. Given a function \(\widetilde{u}\in H^1({[0,T]};H^1(\varOmega )')\cap L^2({[0,T]};H^1(\varOmega ))\) define \(\widetilde{\fancyscript{R}}\in L^2({[0,T]};H^1(\varOmega )')\) through
for almost every \(t\in {[0,T]}\) and all \(v\in H^1(\varOmega )\). Suppose that \(\eta _0,\eta _1\in L^2({[0,T]})\) are such that for almost every \(t\in {[0,T]}\) and all \(v\in H^1(\varOmega )\), we have
Assume that \(\widetilde{\lambda }_\mathrm{AC}\in L^1({[0,T]})\) is a function such that for almost every \(t\in (0,T)\), we have
and set \(\mu _\lambda (t)=2\big (2 + (1-\varepsilon ^2) \widetilde{\lambda }_\mathrm{AC}(t)\big )^+\). Define
and assume that
then
Proof
The difference \(\delta = u-\widetilde{u}\) satisfies
for almost every \(t\in {[0,T]}\) and all \(v\in H^1(\varOmega )\). Choosing \(v=\delta \), using the assumed bound for \(\widetilde{\fancyscript{R}}\), noting Lemma 6.1, and using Young’s inequality we find
The assumption on \(\widetilde{\lambda }_\mathrm{AC}(t)\) shows that
Multiplying this estimate by \(1-\varepsilon ^2\) and using \(f'(\widetilde{u})\ge -1\), we derive the bound
which leads to
Hölder’s inequality and the Sobolev estimate \(\Vert v\Vert _{L^4(\varOmega )}^2\le c_S \Vert v\Vert _{H^1(\varOmega )}^2\) for \(v\in H^1(\varOmega )\) yield that
An integration of the last two estimates over \([0,T']\) shows that we are in the situation of Proposition 6.2 with
and \(A=\eta _\mathrm{AC}^2\), \(B= 6 \varepsilon ^{-4} \Vert \widetilde{u}\Vert _{L^\infty ({[0,T]};L^\infty (\varOmega ))} c_S\), \(\beta =1/2\), and \(E= \exp \big (\int _0^T \mu _\lambda \,{\mathrm d}t\big )\). The proposition thus implies the assertion. \(\square \)
Remarks 6.5
(i) The robust stability result can be proved for a class of nonlinearities \(f\) satisfying the estimates of Lemma 6.1.
(ii) If the exponential factor is bounded by a polynomial in \(\varepsilon ^{-1}\), then we have improved the stability result of Theorem 6.3. We discuss this question below.
1.3 Mean Curvature Flow
The Allen–Cahn equation is closely related to the mean curvature flow that seeks for a given hypersurface \(\fancyscript{M}_0 \subset \mathbb {R}^d\), a family of hypersurfaces \((\fancyscript{M}_t)_{t\in {[0,T]}}\) such that
for every \(t\in {[0,T]}\). Here, \(V\) is the normal velocity of points on the surface and \(H\) is the mean curvature. For a family of spheres \(\big ((\partial B_{R(t)}(0)\big )_{t\in {[0,T]}}\) centered at \(0\) with positive radii \(R:{[0,T]}\rightarrow \mathbb {R}\), we have
The family of spheres thus solves the mean curvature flow if
i.e., if \(R(t) = (T_c-t)^{1/2}\), where \(T_c = R(0)^2\). This equation has a blowup structure and the solution only exists in the interval \([0,T_c)\), cf. Fig. 6.3. To understand the stability of the evolution, we linearize the right-hand side operator \(\psi (R) =1/(2R)\) of the differential equation at the solution \(R(t)\) and obtain
We thus see that \(\lambda _\mathrm{MCF}\) is unbounded at \(t=T_c\) when the surfaces collapse. This reflects the occurrence of large unbounded normal velocities. Nevertheless, for every \(T'<T_c\), we have
Assuming that \(\lambda _\mathrm{MCF} \approx \lambda _\mathrm{AC}\), we will deduce below heuristically that the exponential dependence of the stability estimate in Theorem 6.4 is moderate. To understand the relation between the Allen–Cahn equation and the mean curvature flow let \((\fancyscript{M}_t)_{t\in {[0,T]}}\) be a family of surfaces that solve the mean curvature flow. We assume that for every \(t\in {[0,T]}\), we have \(\fancyscript{M}_t = \partial \varOmega _t\) for a simply connected domain \(\varOmega _t\subset \mathbb {R}^d\) and let \(d_{\fancyscript{M}}(t,\cdot )\) be the signed distance function to \(\fancyscript{M}_t\) that is negative inside \(\varOmega _t\). Given a trajectory \(\phi :{[0,T]}\rightarrow \mathbb {R}^d\) of a point \(x_0=\phi (0) \in \fancyscript{M}_0\), i.e., we have \(\phi (t)\in \fancyscript{M}_t\) for all \(t\in {[0,T]}\), its normal velocity given by
Since \(d_{\fancyscript{M}}(t,\phi (t))=0\) for all \(t\in {[0,T]}\) it follows with \(n(t,x) = \nabla d_{\fancyscript{M}}(t,x)\) for every \(x\in \fancyscript{M}_t\) that
i.e., \(V(t,x) = -\partial _t d_{\fancyscript{M}}(t,x)\) for every \(x\in \fancyscript{M}_t\). Noting that \(D^2d_{\fancyscript{M}}= D(\nabla d_{\fancyscript{M}})\) is the shape operator it follows that for the mean curvature we have \((d-1)H=tr(D^2d_{\fancyscript{M}})= \Delta d_{\fancyscript{M}}\). With \(V=-H\) we deduce that \(\partial _t d_{\fancyscript{M}} - \Delta d_{\fancyscript{M}} = 0\) on \(\fancyscript{M}_t\). The function \(\psi (z) = \tanh (z/\sqrt{2})\) satisfies \(-\psi ''(z)+f(\psi (z))=0\), and this implies that for
we have
Since \(\partial _t d_{\fancyscript{M}} - \Delta d_{\fancyscript{M}} = 0\) on \(\fancyscript{M}_t\), we deduce that if \(d_{\fancyscript{M}}\) is sufficiently smooth, then the function \(g = \partial _t d_{\fancyscript{M}} -\Delta d_{\fancyscript{M}}\) grows linearly in a neighborhood of \(\fancyscript{M}_t\), i.e., we have \(|\partial _t d_{\fancyscript{M}} - \Delta d_{\fancyscript{M}} |\le c |d_{\fancyscript{M}}|\). Noting that the function \(\psi \) satisfies \(|z\psi '(z)|\le c\), we find that
Therefore, the function \(v(t,x)= \psi (d_{\fancyscript{M}}(t,x)/\varepsilon )\) solves the dominant terms of the Allen–Cahn equation \(\partial _t u -\Delta u = - \varepsilon ^{-2} f(u)\) and serves as an approximation of the solution in a neighborhood of width \(\varepsilon \) of the interface \(\varGamma _t\). The profile is illustrated in Fig. 6.4. More details can be found in [5].
1.4 Topological Changes
The mean curvature flow provides a good approximation of the Allen–Cahn equation in the sense that \(v(x,t) = \psi (\mathrm{dist}(x,\fancyscript{M}_t)/\varepsilon )\) nearly solves the Allen–Cahn equation; the family \(\varGamma _t = \{x\in \varOmega : u(x,t) = 0\}\) is a good approximation of a solution for the mean curvature flow. These approximations are valid as long as the interfaces \(\fancyscript{M}_t\) or \(\varGamma _t\) do not undergo topological changes, i.e., as long as \(\fancyscript{M}_t\) or \(\varGamma _t\) does neither split nor have parts of it disappear. This is closely related to the stability of the solution that is measured by the principal eigenvalue \(\lambda _\mathrm{AC}(t)\). It can be shown and it follows from the discussion of the mean curvature flow above, that \(\lambda _\mathrm{AC}\) is bounded from above independently of \(\varepsilon \) as long as the interface \(\varGamma _t\) is smooth and has bounded curvature. When an interface collapses, large, unbounded velocities occur and the eigenvalue \(\lambda _\mathrm{AC}\) attains the upper bound \(\lambda _\mathrm{AC} \sim \varepsilon ^{-2}\). This however only occurs on a time-interval of length comparable to \(\varepsilon ^2\), the characteristic time scale for the Allen–Cahn equation. Due to this fact, we have for the temporal integral of the principal eigenvalue that occurs in the stability analysis
The logarithmic contribution results from the transition regions in which \(\lambda _\mathrm{AC}\) grows like \((T_c-t)^{-1}\) for a topological change at \(t=T_c\). Integrating this quantity up to the time \(T_c-\varepsilon ^2\), where \(\lambda _\mathrm{AC}\) has nearly reached its maximum, reveals that
The logarithmic growth in \(\varepsilon ^{-1}\) of the integrated eigenvalue is precisely what is affordable in the estimate of Theorem 6.4 to avoid an exponential dependence on \(\varepsilon ^{-1}\) and instead obtain an algebraic dependence. A typical behavior of the eigenvalue is depicted in Fig. 6.5.
1.5 Mass Conservation
The Allen–Cahn equation describes phase transition processes in which the volume fractions of the phases may change and the only stationary configurations represent single phases. This corresponds, e.g., to melting processes. In order to model phase separation processes in which the volume fractions are preserved, a constraint has to be incorporated or a fourth order evolution has to be considered. The latter is the \(H^{-1}\)-gradient flow of the energy \(I_\varepsilon \), where \(H^{-1}(\varOmega )=X_0'\) is the dual of the space \(X_0 = \{v\in H^1(\varOmega ):\int _\varOmega v\,{\mathrm d}x=0\}\), i.e.,
Here, the inner product \((v,w)_{-1}\) is for \(v,w\in H^{-1}(\varOmega )\) defined by
where \(-\Delta ^{-1} v\) and \(\Delta ^{-1}w \in X_0\) are the unique solutions of the Poisson problem
with vanishing mean for the right-hand sides \(f=v\) and \(f=w\), respectively. In the strong form the gradient flow reads
together with homogeneous Neumann boundary conditions on \(\partial \varOmega \) for \(u\) and \(\phi \) and initial conditions for \(u\). The variable \(\phi \) is the chemical potential and the system is called the Cahn–Hilliard equation which can be analyzed with the techniques discussed above. Mass conservation is a consequence of the fact that \(\partial _t u\) has vanishing integral mean. Solutions do not obey a maximum principle but satisfy certain \(L^\infty \)-bounds.
2 Error Analysis
In this section we discuss error estimates for numerical approximations of the Allen–Cahn equation obtained with the implicit Euler scheme. The stability result of Theorem 6.4 is already formulated in the spirit of an a posteriori error analysis. We discuss results from [3, 8, 9].
2.1 Residual Estimate
We include an estimate for the residual of an approximation obtained with the implicit Euler scheme. The result can be modified to control the error of other approximation schemes.
Proposition 6.3
(Residual bounds) Let \(0=t_0<t_1<\cdots <t_K\le T\) and \(\tau _k= t_k- t_{k-1}\), \(k=1,2,\ldots ,K\), and \((\fancyscript{T}_k)_{k=0,\ldots ,K}\) a sequence of regular triangulations of \(\varOmega \). Suppose that \((u_h^k)_{k=0,\ldots ,K} \subset H^1(\varOmega )\), for \(k=1,2,\ldots ,K\) and all \(v_h\in \fancyscript{S}^1(\fancyscript{T}_k)\), satisfies
where \(\fancyscript{I}_k\) denotes the nodal interpolation operator related to \(\fancyscript{S}^1(\fancyscript{T}_k)\). Let \(u_{h,\tau }\in H^1({[0,T]};H^1(\varOmega ))\) be the piecewise linear interpolation in time of \((u_h^k)_{k=0,\ldots ,K}\) and define \(\fancyscript{R}\in L^2(I;H^1(\varOmega )')\) for \(t\in {[0,T]}\) and \(v\in H^1(\varOmega )\) by
For almost every \(t\in [t_{k-1},t_k]\) and all \(v\in H^1(\varOmega )\) we have
where \(\rho _k= \Vert u_h^k\Vert _{L^\infty (\varOmega )} + \Vert u_h^{k-1}\Vert _{L^\infty (\varOmega )}\),
and
Proof
For almost every \(t\in (t_{k-1},t_k)\), \(k=1,2,\ldots ,K\), and all \(v\in H^1(\varOmega )\), we have by definition of \(\fancyscript{R}\) that
Since the sum of the first three terms vanishes for all \(v\in \fancyscript{S}^1(\fancyscript{T}_k)\), we may insert the Clément interpolant \(\fancyscript{J}_k v\in \fancyscript{S}^1(\fancyscript{T}_k)\) of \(v\). An element-wise integration by parts and estimates for the Clément interpolant lead to
A repeated application of Hölder’s inequality, the identity
and the linearity of \(u_{h,\tau }\) in \(t\) lead to
A further application of Hölder’s inequality proves
A combination of the estimates leads to the asserted bound. \(\square \)
In combination with Theorem 6.4 we obtain the following a posteriori error estimate. It bounds the approximation error in terms of computable quantities provided that the error estimator is sufficiently small and depends exponentially only on the temporal average of the principal eigenvalue defined by the numerical approximation.
Theorem 6.5
(A posteriori error estimate) Assume that we are in the setting of Proposition 6.3 and suppose that \(\lambda _\mathrm{AC}^h \in L^1({[0,T]})\) is a function, such that for almost every \(t\in (0,T)\), we have
and set \(\mu _\lambda (t)=2(2 + (1-\varepsilon ^2) \lambda _\mathrm{AC}^h(t))^+\). Define \(\eta _\ell (t) = \eta _\ell ^k\) for \(t\in (t_{k-1},t_k)\), \(k=1,2,\ldots ,K\), and \(\ell \in \{\mathrm{time}^\prime ,\mathrm{time},\mathrm{space},\mathrm{coarse}\}\) and let
If
then we have
Proof
The theorem is an immediate consequence of Proposition 6.3 and Theorem 6.4. \(\square \)
2.2 A Priori Error Analysis
To derive a robust a priori error estimate for a semidiscrete in time approximation scheme, we try to follow the arguments used in the stability analysis of Theorem 6.3 with exchanged roles of the exact solution and its numerical approximation. As above we avoid the use of a Lipschitz estimate for the nonlinearity, and instead employ a linearization. The non-monotonicity of the resulting equation is controlled by a cubic term. The linearization allows us to incorporate the principal eigenvalue that is assumed to be well-behaved in the sense that a discrete integral grows only logarithmically in \(\varepsilon ^{-1}\).
Proposition 6.4
(Discrete stability) Given \(\tau >0\) let \((U^k)_{k=0,\ldots ,K}\subset H^1(\varOmega )\) be such that
for \(k=1,2,\ldots ,K\) and all \(v\in H^1(\varOmega )\). We then have
for every \(1\le L\le K\). Moreover, if \(\Vert U^0\Vert _{L^\infty (\varOmega )} \le 1\), then \(\Vert U^k\Vert _{L^\infty (\varOmega )}\le 1\) for \(k=1,2,\ldots ,K\).
Proof
The mean value theorem shows that for every \(x\in \varOmega \) there exists a number \(\xi _x\) such that
Using that \(f^\prime (\xi _x)\ge -1\) and choosing \(v=d_t U^k\), we deduce that
Multiplication by \(\tau \) and summation over \(k=1,2,\ldots ,L\) imply the assertion. A truncation argument and the characterization of \(U^k\) as the minimum of a functional \(I_\varepsilon ^k\) show that \(\Vert U^k\Vert _{L^\infty (\varOmega )}\le 1\) provided that \(U^0\) has this property. \(\square \)
Proposition 6.5
(Consistency) Assume that the weak solution of the Allen–Cahn equation satisfies \(u\in C({[0,T]};H^1(\varOmega ))\) and \(u\in H^2({[0,T]};H^1(\varOmega )^\prime )\) with
For \(u^k= u(t_k)\), \(k=0,1,\ldots ,K\), we have
for all \(v\in H^1(\varOmega )\) with consistency functionals \(\fancyscript{C}_\tau (t_k)\) satisfying
We have \(\sigma =2\) if \(I(u_0)\le c\).
Proof
Noting that
for all \(v\in H^1(\varOmega )\), arguing as in the case of the linear heat equation, and incorporating Theorem 6.2 proves the asserted bound. \(\square \)
The following lemma is a generalization of the classical discrete Gronwall lemma which states that if
for \(0\le L^\prime \le L\) and if \(\tau a_k \le 1/2\) for \(k=1,2,\ldots ,L\), then we have
The condition \(a_k\tau \le 1/2\) is required to absorb the term \(a_{L'}y^{L'}\).
Lemma 6.2
(Generalized discrete Gronwall lemma) Let \(\tau >0\) and suppose that the nonnegative real sequences \((y_\ell ^k)_{k=0,\ldots ,K}\), \(\ell =1,2,3\), \((a_k)_{k=0,\ldots ,K}\), and the real number \(A\ge 0\) satisfy
for all \(L=0,1,\ldots ,K\), \(\sup _{k=1,\ldots ,K} \tau a_k \le 1/2\), and \(K\tau \le T\). Assume that for \(B \ge 0\), \(\beta >0\), and every \(L=1,2,\ldots ,K\), we have
Set \(E =\exp \big (2\tau \sum _{k=1}^K a_k \big )\) and assume that \(8AE \le (8 B (1+T)E )^{-1/\beta }\). Then
Proof
Set \(\theta =8AE\). We proceed by induction and suppose that
This is satisfied for \(L=1\). For every \(L^\prime =1,2,\ldots ,L\), we then have due to the assumptions of the lemma that
The classical discrete Gronwall lemma, the condition on \(A\), and the estimate \(\theta ^\beta \le (8 B(1+T)E)^{-1}\) prove that for all \(L^\prime =1,2,\ldots ,L\), we have
This completes the inductive argument and proves the lemma. \(\square \)
The a priori bounds and the generalized discrete Gronwall lemma lead to a robust a priori error estimate under an assumption on the principal eigenvalue that is motivated by analytical considerations.
Theorem 6.6
(A priori error estimate) Assume \(\varepsilon \le 1\), \(I_\varepsilon (u_0)\le c_0\), and that there are \(c_1>0\), \(\kappa \ge 0\) with
Then there exists a constant \(c_2>0\) such that if \(\tau \le c_2 \varepsilon ^{7 + 6\kappa }\), we have
Proof
Denoting \(u^k= u(t_k)\) the error \(e^k = u^k-U^k\) satisfies the identity
for all \(v\in H^1(\varOmega )\). Lemma 6.1, the definition of \(\lambda _\mathrm{AC}(t_k)\), and \(\Vert u^k\Vert _{L^\infty (\varOmega )}\le 1\) imply that
Hence, for the choice of \(v=e^k\), we find that
Using \((a+b)^3 \le 4 (a^3+b^3)\) and \(\tau \Vert d_te^k\Vert _{L^\infty (\varOmega )} \le 4\) we find that
If \(\tau \) is sufficiently small so that \(48 \tau \varepsilon ^{-2} \le 1/2\), then the combination of the last two estimates implies
where \(\mu _\lambda ^k = 2 (2 + \lambda _\mathrm{AC}^+(t_k))\). We set
Noting that \(e^0=0\) and
we find by summation of (6.2) and (6.3) over \(k=1,2,\ldots ,L\) that we are in the situation of Lemma 6.2 with
and \(\beta =1/2\). Therefore,
provided that \(8AE\le (8 B (1+T)E )^{-2}\). Since according to Proposition 6.5 we have \(A\le c \tau ^2 \varepsilon ^{-6}\), this is satisfied if \(c_B \tau ^2 \varepsilon ^{-6} E \le (8 B (1+T)E )^{-2}\). With the assumed bound for the discrete integral of \(\lambda _\mathrm{AC}^+\), we deduce that
Therefore, the condition \(\tau ^2\le c \varepsilon ^{14} \varepsilon ^{12\kappa }\) implies the assertion. \(\square \)
Remarks 6.6
(i) If \(u_{tt}\in L^2({[0,T]};L^2(\varOmega ))\), then the bound for \(A\) in the proof can be improved and the conditions of the theorem can be weakened.
(ii) An a priori error analysis for a fully discrete approximation follows the same strategy by decomposing the error \(u(t_k)-u_h^k\) as \((u(t_k)-Q_hu(t_k)) + (Q_h u(t_k)-u_h^k)\) with the \(H^1\)-projection \(Q_h\), cf. [8].
3 Practical Realization
We discuss in this section alternatives to the implicit Euler scheme and include an estimate for the approximation of the principal eigenvalue that is needed to compute the a posteriori error bound.
3.1 Time-Stepping Schemes
The implicit Euler scheme requires the solution of a nonlinear system of equations in every time step and is stable under the condition \(\tau \le 2{\varepsilon }^2\). We consider various semi-implicit approximation schemes defined by approximating the nonlinear term avoiding some of these limitations.
Algorithm 6.1
(Semi-implicit approximation) Given \(u_h^0 \in \fancyscript{S}^1(\fancyscript{T}_h)\), \(\tau >0\), and a continuous function \(G : \mathbb {R}\times \mathbb {R}\rightarrow \mathbb {R}\) let the sequence \((u_h^k)_{k=0,\ldots ,K}\) be defined by
for all \(v_h\in \fancyscript{S}^1(\fancyscript{T}_h)\).
The function \(G\) is assumed to provide a consistent approximation of the nonlinear function \(f\) in the sense that \(G(s,s) = f(s)\).
Examples 6.1
(i) The (fully) implicit Euler scheme corresponds to
(ii) The choice of
realizes an explicit treatment of the nonlinearity.
(iii) Carrying out one iteration of a Newton scheme in every time step of the implicit Euler scheme with initial guess \(u_h^{k-1}\) corresponds to the linearization
(iv) A Crank–Nicolson type treatment of the nonlinear term is
We have \(G^\mathrm{cn}(u^k,u^{k-1}) = (1/4)(u^k+u^{k-1})((u^k)^2+(u^{k-1})^2-2)\).
(v) The decomposition \(F=F^{cx}+F^{cv}\) of \(F(u^{k-1})=((u^k)^2-1)^2/4\) into a convex part \(F^{cx}(u^{k-1}) = ((u^k)^4+1)/4\) and a concave part \(F^{cv}(u^{k-1}) = -(1/2)(u^{k-1})^2\) leads with the derivatives \(f^{cx}\) and \(f^{cv}\) of \(F^{cx}\) and \(F^{cv}\), respectively, to the definition
Remarks 6.7
(i) Only the explicit and linearized treatment of the nonlinear term leads to linear systems of equations in every time step. The convex-concave decomposition leads to monotone systems of equations.
(ii) The best compromise for stability and linearity appears to be the linearized treatment of the nonlinear term.
(iii) The decomposition of \(F\) into convex and concave parts corresponds to the general concept to treat monotone terms implicitly and anti-monotone terms explicitly.
(iv) Numerical integration simplifies the nonlinearities, i.e., for all \(z,y\in \fancyscript{N}_h\), we have
with \(\beta _z = \int _\varOmega \varphi _z\), so that the corresponding contribution to the system matrix is given by a diagonal matrix.
(v) The numerical schemes have different numerical dissipation properties.
The stability of the different semi-implicit Euler schemes is a consequence of the following proposition. We omit a discussion of the explicit treatment of the nonlinearity since this is experimentally found to be unstable even for \(\tau \sim {\varepsilon }^2\).
Proposition 6.6
(Semi-implicit Euler schemes) Given \(u^k,u^{k-1}\in \mathbb {R}\) and \(\tau >0\), we set \(d_tu^k = (u^k-u^{k-1})/\tau \). We have
and if \(|u^k|,|u^{k-1}|\le 1\), then
In particular, the implicit Euler scheme is stable if \(\tau \le 2\varepsilon ^2\), the semi-implicit Euler scheme with Crank–Nicolson type treatment of the nonlinear term is unconditionally stable, the semi-implicit Euler scheme with decomposed treatment of the nonlinearity is unconditionally stable, and the semi-implicit Euler scheme with a linearized treatment of the nonlinear term is stable if a discrete maximum principle holds and \(\tau \le (2/7)\varepsilon ^2\), i.e., under these conditions we have for the solutions of the respective semi-implicit Euler schemes that
for all \(L\ge 0\).
Proof
A Taylor expansion shows that for some \(\xi \in \mathbb {R}\), we have
Since \(f^\prime (\xi )\ge -1\) we deduce after division by \(\tau \) that
and this implies the bound for \(G^\mathrm{impl}\). Assuming that \(|u^k|,|u^{k-1}|\le 1\), a similar argument with \(f''(s)=6s\) shows with some \(\zeta \in [-1,1]\) that
and with the previous estimate we deduce that
If \(d_t u^k \ne 0\), then
and if \(d_t u^k=0\), then \(G^\mathrm{cn}(u^k,u^{k-1}) d_t u^k = 0 = \tau d_t F(u^k)\) which implies the asserted identity for \(G^\mathrm{cn}\). For the convex function \(F^{cx}\) and its derivative \(f^{cx}\), we have
Analogously, for the convex function \(-F^{cv}\) and its derivative \(-f^{cv}\), we have
The combination of the two estimates proves that
The stability of the related schemes now follows from the choice of \(v_h = d_t u_h^k\) in the semi-implicit Euler scheme, i.e.,
together with a summation over \(k=1,2,\ldots ,L\), and the corresponding lower bounds for \(G(u_h^k,u_h^{k-1})\). \(\square \)
3.2 Computation of the Eigenvalue
The a posteriori error estimate of Theorem 6.5 requires a lower bound for the principal eigenvalue of the linearized Allen–Cahn operator with respect to the approximate solution, i.e., a function \(\lambda _\mathrm{AC}^h\) such that
To approximate the infimum on the right-hand side, we replace the space \(H^1(\varOmega )\) by \(\fancyscript{S}^1(\fancyscript{T}_h)\). We fix a time \(t\) in the following and let \(-\varLambda \in \mathbb {R}\) be the infimum at time \(t\), i.e., there exists \(w\in H^1(\varOmega )\) with \(\Vert w\Vert =1\) and
for all \(v\in H^1(\varOmega )\) and with \(p_h = f'(u_{h,\tau }(t))\).
Proposition 6.7
(Eigenvalue approximation) Let \((\varLambda _h,w_h)\in \mathbb {R}\times \fancyscript{S}^1(\fancyscript{T}_h)\) be such that
for all \(v_h\in \fancyscript{S}^1(\fancyscript{T}_h)\). Assume that the Laplace operator with homogeneous Neumann boundary conditions is \(H^2\)-regular in \(\varOmega \) in the sense that \(\Vert D^2 v\Vert \le c_\Delta \Vert \Delta v\Vert \) for all \(v\in H^2(\varOmega )\) with \(\partial _nv = 0\) on \(\partial \varOmega \) and suppose that \(\Vert p_h\Vert _{L^\infty (\varOmega )} \le c_0\). Then there exists \(c_1>0\) such that if \(h\le c_1 \varepsilon \), we have
Proof
In the following we occasionally replace the function \(p_h\) by \(q_h = p_h+\Vert p_h\Vert _{L^\infty (\varOmega )}\) which corresponds to a shift of \(-\varLambda \) and \(-\varLambda _h\) by \(\Vert p_h\Vert _{L^\infty (\varOmega )}\) but allows us to use \(q_h \ge 0\). The fact that \(\fancyscript{S}^1(\fancyscript{T}_h)\subset H^1(\varOmega )\) implies that we have \(-\varLambda \le -\varLambda _h\). Since \(w_h\) is minimal for \(v_h \mapsto \Vert \nabla v_h\Vert ^2 + \varepsilon ^{-2}(p_hv_h,v_h)\) among functions \(v_h\in \fancyscript{S}^1(\fancyscript{T}_h)\) with \(\Vert v_h\Vert =1\) with minimum \(-\varLambda _h\) and since \(-\varLambda = \Vert \nabla w\Vert ^2 + \varepsilon ^{-2} (p_h w,w)\), we have
We note \(-\varLambda \le \varepsilon ^{-2} \Vert p_h\Vert _{L^\infty (\varOmega )}\) and conclude with \(-\Delta w = -\varLambda w - \varepsilon ^{-2} p_h w\) that
We incorporate the \(H^1\)-projection \(Q_h w \in \fancyscript{S}^1(\fancyscript{T}_h)\) defined by
for all \(y_h\in \fancyscript{S}^1(\fancyscript{T}_h)\) which satisfies the estimates
We suppose that \(h\le c \varepsilon \) is such that
Choosing \(v_h = Q_h w/\Vert Q_h w\Vert \) and noting
we find that
Analogously, we have
A combination of the estimates implies the asserted error bound. \(\square \)
The discrete eigenvalue problem can be recast as the problem of finding a vector \(W\in \mathbb {R}^L\) with and
with the mass matrix \(m\), the stiffness matrix \(s\), the weighted mass matrix \(m_p\), and an arbitrary constant \(c_\mathrm{shift}\). For \(c_\mathrm{shift} = \varepsilon ^{-2}\Vert p_h\Vert _{L^\infty (\varOmega )} + 1\), we have that the symmetric matrices \(m\) and \(Y = s+\varepsilon ^{-2} m_p + c_\mathrm{shift}m\) are positive definite, and we may use the following vector iteration with Rayleigh-quotient approximation to approximate \(\varLambda \).
Algorithm 6.2
(Vector iteration) Given \(W_0\in \mathbb {R}^L\) such that , compute the sequence \(\varLambda ^j\), \(j=0,1,2,\ldots \) via and
and
Stop the iteration if \(|\varLambda ^{j+1}-\varLambda ^j|\le \varepsilon _\mathrm{stop}\).
Remark 6.8
The iteration converges to the smallest eigenvalue provided that the initial vector \(W_0\) is not orthogonal to the corresponding eigenspace.
3.3 Implementation
The Matlab code shown in Fig. 6.6 realizes the semi-implicit Euler scheme with linearized treatment of the nonlinear term and computes the principal eigenvalue defined by the approximate solution in every time step. We used the discrete inner product \((\cdot ,\cdot )_h\) to simplify the computation of some matrices, i.e., we use the formulations
and
for all \(v_h \in \fancyscript{S}^1(\fancyscript{T}_h)\) to find \(u_h^k\in \fancyscript{S}^1(\fancyscript{T}_h)\) and an approximation of the eigenpair \((-\lambda _\mathrm{AC}^h(t_k),w_h)\).
References
Alikakos, N.D., Fusco, G.: Slow dynamics for the Cahn-Hilliard equation in higher space dimensions. I. Spectral estimates. Commun. Partial Differ Equ 19(9–10), 1397–1447 (1994). http://dx.doi.org/10.1080/03605309408821059
Barrett, J.W., Blowey, J.F.: An error bound for the finite element approximation of the Cahn-Hilliard equation with logarithmic free energy. Numer. Math. 72(1), 1–20 (1995). http://dx.doi.org/10.1007/s002110050157
Bartels, S., Müller, R., Ortner, C.: 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(1), 110–134 (2011). http://dx.doi.org/10.1137/090751530
Chen, X.: Spectrum for the Allen-Cahn, Cahn-Hilliard, and phase-field equations for generic interfaces. Commun. Partial Differ Equ 19(7–8), 1371–1395 (1994). http://dx.doi.org/10.1080/03605309408821057
Deckelnick, K., Dziuk, G., Elliott, C.M.: Computation of geometric partial differential equations and mean curvature flow. Acta Numer. 14, 139–232 (2005). http://dx.doi.org/10.1017/S0962492904000224
Elliott, C.M., French, D.A.: Numerical studies of the Cahn-Hilliard equation for phase separation. IMA J. Appl. Math. 38(2), 97–128 (1987). http://dx.doi.org/10.1093/imamat/38.2.97
Emmerich, H.: The Diffuse Interface Approach in Materials Science. Lecture Notes in Physics, vol. M 73. Springer, Berlin (2003)
Feng, X., Prohl, A.: Numerical analysis of the Allen-Cahn equation and approximation for mean curvature flows. Numer. Math. 94(1), 33–65 (2003). http://dx.doi.org/10.1007/s00211-002-0413-1
Kessler, D., Nochetto, R.H., Schmidt, A.: A posteriori error control for the Allen-Cahn problem: circumventing Gronwall’s inequality. M2AN Math. Model. Numer. Anal. 38(1), 129–142 (2004). http://dx.doi.org/10.1051/m2an:2004006
Nochetto, R.H., Verdi, C.: Convergence past singularities for a fully discrete approximation of curvature-driven interfaces. SIAM J. Numer. Anal. 34(2), 490–512 (1997). http://dx.doi.org/10.1137/S0036142994269526
Penrose, O., Fife, P.C.: Thermodynamically consistent models of phase-field type for the kinetics of phase transitions. Phys. D 43(1), 44–62 (1990). http://dx.doi.org/10.1016/0167-2789(90)90015-H
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Bartels, S. (2015). The Allen–Cahn Equation. In: Numerical Methods for Nonlinear Partial Differential Equations. Springer Series in Computational Mathematics, vol 47. Springer, Cham. https://doi.org/10.1007/978-3-319-13797-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-13797-1_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13796-4
Online ISBN: 978-3-319-13797-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)