WorksMathematics
Fully Explicit Stabilized Runge–Kutta Methods for Allen–Cahn and Cahn–Hilliard Dynamics
Abstract
Stiff phase-field dynamics are typically solved by semi-implicit or fully implicit time discretizations, since the interfacial scales in the Allen–Cahn and Cahn–Hilliard equations impose severe step-size restrictions on standard explicit methods. In this paper, we investigate a different strategy based on stabilized Runge–Kutta solvers, in particular the Runge–Kutta–Legendre (RKL) and Runge–Kutta–Gegenbauer (RKG) families. These schemes possess enlarged stability regions and therefore provide a natural explicit framework for diffusion-dominated gradient flows without requiring implicit solves. For the Allen–Cahn equation, combined with Strang splitting, we establish a maximum principle in 1-dimensional case, and prove energy dissipation in all the dimensions. For the modified energy dissipation analysis, we further introduce two new first-order stabilized schemes of RKL and RKG type and derive a novel eigenvalue estimate for the second-order RKG method. We also conduct extensive numerical experiments with both constant and adaptive time stepping, on regular domains as well as on an L-shaped irregular domain. The numerical results show that stabilized explicit Runge–Kutta methods provide an effective and flexible approach for the numerical simulation of Allen–Cahn and Cahn–Hilliard dynamics while preserving key structural properties. The Python implementation is available at https://github.com/ZT220501/SRK-for-Gradient-Flows.
Graphical Abstract
Highlights
Fully Explicit Stabilized Runge–Kutta Methods for Allen–Cahn and Cahn–Hilliard Dynamics
Zheng Tan, Tariq D. Aslam, Andrea L. Bertozzi
Stabilized Runge–Kutta methods for fully explicit, non-spectral solution approach of the Allen–Cahn and the Cahn–Hilliard Dynamics.
The Maximum principle is proved when applying to the Allen–Cahn equation.
Modified energy dissipation is proved for two Strang splitting orders.
The method applies to irregular domains without Fourier spectral methods.
Introduction
Phase-field models are prevalent in science and engineering, particularly in material science and fluid dynamics, see for example [1, 2, 3, 4, 5, 6, 7]. Therefore, it is important to efficiently and accurately solve the equations numerically. In this work, we consider two of the most well-known phase-field equations, namely the Allen–Cahn equation
and the Cahn–Hilliard equation
with initial condition . Here is a bounded domain and is a finite time. Throughout this paper, we use the classical double-well potential . We use either the periodic boundary conditions, or the homogeneous Neumann boundary condition
*Corresponding author
Email addresses: [email protected] (Zheng Tan), [email protected] (Tariq D. Aslam), [email protected] (Andrea L. Bertozzi) where and is the outward normal of .
The Allen–Cahn and the Cahn–Hilliard equations are well-known to be the gradient flows of the Ginzburg–Landau energy
More precisely, the -gradient flow results in the Allen–Cahn equation, while the -gradient flow results in the Cahn–Hilliard equation. Therefore, a successful numerical scheme should also preserve the energy dissipation property to obtain physically correct solutions; more precisely, the numerical solution should satisfy
We call a scheme energy stable if the above condition is satisfied. Another important property of the second-order parabolic Allen–Cahn equation is the maximum principle: if , then for all . Therefore, it is also essential for a numerical scheme to satisfy the maximum principle for the Allen–Cahn equation.
Preserving numerical energy stability is central to schemes for gradient flow simulations. An abundance of numerical evidence shows that spurious oscillations may occur when the energy stability condition is violated. Numerical effort has been devoted for energy stable schemes development, including [8, 9, 10, 11]. Since the spatial derivative is second or fourth order, the stability constraint limits the usage of classical explicit methods, leading to the need to solve an implicit system at each step. The recently deployed exponential time differencing Runge–Kutta schemes (ETDRK) [12, 13, 14], although they avoid implicit solves and monotonically dissipate energy, rely heavily on the Fourier spectral methods so that on non-periodic irregular domains, it degenerates into an implicit method because of the need for a stabilization parameter.
In this paper, we explore the potential of fully explicit stabilized Runge–Kutta methods called Runge–Kutta–Legendre (RKL) and Runge–Kutta–Gegenbauer (RKG) methods for solving the Allen–Cahn and Cahn–Hilliard equations. The RKL and RKG methods are super-time-stepping multistage methods that admit stability constraints to be relaxed quadratically with their number of stages. We prove that the RKL and RKG methods preserve the maximum principle for the Allen–Cahn equation when combined with the Strang splitting, under periodic or Neumann boundary conditions. Modified energy dissipations for the RKL and RKG methods are proved when they are applied to the Allen–Cahn equation, and the dissipated energy is shown to converge to the exact energy. We also conduct numerous experiments to demonstrate the behaviors when the RKL and RKG methods are applied to the gradient flows. Specifically, an irregular domain experiment is conducted to demonstrate the effectiveness of the methods for a case where the Fourier spectral method cannot be easily applied.
This paper is organized as follows. In Section 2 we review some of the well-known numerical schemes that efficiently and accurately solve the gradient flows while preserving the energy stability, with their advantages and limitations. Section 3 introduces the RKL and RKG methods and describes how we apply them to the gradient flows. Following that, in Section 4 we prove the maximum principle and the modified energy dissipation for RKL and RKG schemes. We conduct comprehensive experiments in Section 5 to demonstrate the behavior of RKL and RKG methods when applied to gradient flows. Concluding remarks and potential research directions are presented in Section 6.
Review of schemes for simulating gradient flows
Various schemes have been designed in order to satisfy the maximum principle of the Allen–Cahn equation and energy stability of the gradient flows. In this section, we present several of the most representative methods, in roughly chronological order.
Convex splitting
One of the pioneering works for energy dissipating Cahn–Hilliard simulation is the convex splitting technique [8]. Assume that the energy can be split into the difference of two convex functions; more precisely, where both are convex. Then one treats the positive convex part to be implicit and negative convex part to be explicit, so that the first-order convex splitting method for Cahn–Hilliard reads
It is shown that [8]
so that the scheme dissipates the energy as desired. However, a nonlinear system needs to be solved at every step, leading to inefficient computation.
Implicit-Explicit (IMEX) methods
Another approach, to some extent similar to the convex splitting idea, is the implicit-explicit (IMEX) method [9]. Instead of splitting the energy , the IMEX approach directly treats the linear part implicitly while treating the nonlinear part explicitly. Therefore, only a linear system needs to be solved at each step.
Several works have studied IMEX methods for parabolic equations and gradient flows [9, 15, 16, 17]. Although only linear system solving is required, the IMEX method may still only attain conditional energy dissipation, unless additional stabilization techniques [18] are used. Therefore, more unconditional energy dissipation techniques are developed, as will be introduced in the following subsections.
Lagrange multiplier approaches
One of the novel approaches for solving gradient flows utilizes the idea of Lagrange multiplier. X. Yang and his collaborators apply the Lagrange multiplier approach to the class of gradient flows with free energies bounded below [10, 19, 20, 21, 22, 23, 24, 25, 26] and develop the invariant energy quadratization (IEQ) method. To illustrate the approach, consider the Cahn–Hilliard equation written in the form of
With the free energy uniformly bounded below such that , one introduces the Lagrange multiplier , and rewrites Equation (5) as
The IEQ method solves (6) with numerical methods such as Crank-Nicolson or BDF schemes. Taking the inner product of the above with , , and respectively, the IEQ method naturally satisfies the modified energy dissipation law
so that the energy stability is automatically guaranteed.
Though unconditionally energy stable, the IEQ method requires solving a variable coefficient system of equations every step. This disadvantage is overcome by the scalar auxiliary variable (SAV) approach [11]. Instead of assuming the free energy is bounded below, the SAV approach assumes that the nonlinear part of energy is bounded from below such that . By introducing the Lagrange multiplier , the Cahn–Hilliard equation (5) can be rewritten as
Using Crank-Nicolson or BDF methods, only scalar-coefficient systems are needed to be solved at each step for the SAV method. A similar modified energy dissipation law also holds for the SAV approach
Extensive follow-up works of the SAV method [27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37] demonstrate its effectiveness across various gradient flow problems. However, the method still requires solving an implicit system of equations at each step since explicit solvers cannot be applied to (6) or (7) directly, leading to the need for solving two Poisson-type equations per step [11].
Exponential time differencing (ETD) methods
A popular and active line of research is the use of exponential time differencing (ETD) methods [38] for solving the phase-field equation. The phase-field equation has the semi-linear right hand side structure
where is a non-positive operator, is a positive-definite operator, and is a (nonlinear) function. Using Duhamel’s principle, the exact solution is
The ETD methods are then developed by approximating the integral. A major advantage of the ETD methods is that the linear stiff part is exactly integrated, so that larger timesteps can be chosen after the matrix exponentials are computed using the Fourier transform.
The most widely used ETD methods are the ETD Runge–Kutta (ETDRK) methods, which use RK schemes to approximate the integral in (8). Much of the existing literature has studied the ETDRK methods for semi-linear parabolic equations and gradient flows [13, 39, 40, 12, 14, 41]. The discrete maximum principle for first- and second-order ETDRK methods (ETDRK1, ETDRK2) are proved for the second-order parabolic equations [40]. The dissipation of the original energy for the Ginzburg–Landau gradient flow was proved for ETDRK1, ETDRK2 [12]; later a general sufficient criterion for ETDRK of arbitrary order is later proposed, along with a novel energy dissipating ETDRK3 method [14]. The existence of energy dissipating ETDRK4 or higher order ETDRK methods is still an open problem.
Although implicit equation solvers are not needed for the ETDRK methods, the success of ETDRK methods for gradient flows largely relies on the effectiveness in computing the matrix exponentials under the periodic boundary condition within a regular domain. Since the Laplacian operator is diagonalizable in the Fourier domain, the computational cost is only if there are grids for each direction in two dimension [13]. However, if a non-periodic boundary condition is applied, the Fourier spectral method cannot be directly applied [42]. Moreover, a stabilization parameter is needed in practice in order for the method to behave well and preserve the maximum principle [12], making the method essentially implicit with the need for tuning the stabilization parameter.
Stabilized Runge–Kutta methods
Due to the stiff nature of gradient flows, the existing methods in Section 2 either use (semi-)implicit approaches, or utilize the exponential time differencing approach along with the Fourier transform and stabilization technique. Although linear and energy stability can be guaranteed with mild or no constraints, the (semi-)implicit methods require solving a linear or nonlinear system at each step, while the exponential time differencing approach requires computing matrix exponential, leading to heavy computational overhead.
In this section, we utilize a class of stabilized Runge–Kutta (SRK) methods for solving the Allen–Cahn and Cahn–Hilliard equations, more specifically the Runge–Kutta–Legendre (RKL) and Runge–Kutta–Gegenbauer (RKG) methods. The SRK methods are fully explicit methods, and do not rely on any computations in the Fourier domain or stabilization techniques. Although the SRK methods are only conditionally stable due to their explicit nature, the region of absolute stability of the SRK methods grow proportionally to where is the number of sub-stages, leading to mild stability constraints in practice. Rigorous analysis shows that along with Strang splitting, the RKL and RKG methods preserve the maximum principle under the linear stability constraints. Following similar arguments as in [43, 44], modified energy dissipation for two different ways of Strang splittings are proved for the Allen–Cahn equation, with new first-order methods and an estimation for the second-order RKG (RKG2) method. The modified energy is shown to converge to the exact energy as .
We note that the existing literature has briefly explored the use of super-time-stepping method for Cahn–Hilliard equation simulation [45]. However, they utilize Runge–Kutta–Chebyshev method and the DUMKA3 methods and only simulated the fourth-order Cahn–Hilliard and molecular beam epitaxy (MBE) equations; such methods have been numerically shown to violate the discrete maximum principle [46], so that they cannot be extended to the Allen–Cahn equation simulation. Moreover, our method is independent of spatial discretization, so that it can be applied to more generally shaped domains in addition to rectangular periodic domains, as will be shown in § 7. Finally, we provide an energy dissipation theoretical guarantee for the Allen–Cahn equation simulation with the SRK, for different ways of Strang splittings.
Stabilized Runge–Kutta methods overview
The Runge–Kutta–Legendre methods [46] and Runge–Kutta–Gegenbauer methods [47, 48] are super-time-stepping methods originally designed to solve for an ordinary differential equation (ODE) system
where is a symmetric, constant coefficient matrix that represents the discretization of a parabolic operator; the operator is required to have non-positive, real eigenvalues to ensure convergence. It is also shown [46, 47, 48] that the RKL and RKG methods are effective for variable coefficient problems, and later [49, 50] apply this class of method for broader applications.
We present the derivation of the RKL and RKG methods. The RKL and RKG methods are based on the shifted Legendre and Gegenbauer polynomials, respectively. The general form of the RKL and RKG methods is
where is the “stability polynomial" of the numerical method. Numerical stability is ensured if for all eigenvalues of ; therefore, boundedness of Legendre polynomials and Gegenbauer polynomials enables them to be the stability polynomial choices [46, 48]. By matching the leading order terms in Taylor expansion as in [46, 48], the RKL1, RKL2, RKG1, and RKG2 methods, respectively, take the form of
where is the -th degree Legendre polynomial and is the -th degree Gegenbauer polynomial with parameter defined in the standard literature. In all of our experiments, is chosen to be in order to be consistent with [48].
To obtain a Runge–Kutta formulation of the RKL and RKG methods, [46, 48] use the recurrence relationship of the Legendre and Gegenbauer polynomials. For example, the RKL2 method uses the Legendre polynomial recurrence relationship
Together with the initial Legendre polynomials, after rearranging terms, one superstep of the -stage RKL2 method can be written as
where the parameters are specified in [46]. Similar derivations work for the RKL1 method [46] and the RKG methods [48] using the recurrence relation between the Legendre and Gegenbauer polynomials of different degrees.
Although the formulas appear complicated, the method is entirely explicit and can be easily implemented with only three stages of the solution storage required. Moreover, the stability constraint is much more relaxed than a usual explicit method: denote where is the maximum eigenvalue of the operator ; as shown in [46], the largest possible timestep is . The restriction is relaxed quadratically with respect to , so that when we choose large enough, the restriction on related to is almost negligible. Moreover, it is simple to control the stage number in the implementation. These advantages lead to the adaptive use of in our complete algorithm.
Despite the fact that RKL and RKG methods were primarily designed to ensure the discrete maximum principle under different boundary conditions, the theoretical proof of their discrete maximum principle remained unsolved for a long time. Our recent work [49] fully proved the discrete maximum principle of RKL1, RKL2, RKG1, and RKG2 methods when applied to the heat equation, under the periodic or homogeneous Neumann boundary condition for rectangular domains. The discrete maximum principle of the Allen–Cahn equation therefore follows, as shown in § 6.1.
Stabilized Runge–Kutta methods applied to gradient flows
With the above description, we now apply the stabilized Runge–Kutta methods to the Allen–Cahn and Cahn–Hilliard equations. For the Allen–Cahn equation (1), since the nonlinear part is a double-well potential, we utilize the Strang splitting [51] technique so that the nonlinear part is solved exactly, while the numerical monotonicity can be guaranteed easily as will be shown in Theorem 4.1. By writing
our Strang splitting scheme reads
with the discrete Laplacian used being the standard central difference operator.
For the Cahn–Hilliard equation, since in this paper we in general do not want to use the Fourier spectral method for spatial discretization, we choose to not use Strang splitting as in [45] but instead discretize the spatial domain with standard central difference, and apply the SRK method with corresponding to the discretized right-hand side of the Cahn–Hilliard equation.
Maximum Principle and Modified Energy Dissipation
In this section, we prove the maximum principle and the energy dissipation when applying RKL and RKG methods to the Allen–Cahn equation via Strang splitting.
Maximum principle for Allen–Cahn via Strang splitting
In this section, we present the proof of the discrete maximum principle for the RKL and RKG methods when applied to the Allen–Cahn equation. More precisely, we want to show that if the initial condition is uniformly bounded by 1, then for any further time . The discrete analogue is therefore described and proved in the following theorem, utilizing the power of Strang splitting [51] and the monotone stability results proved in [49].
Theorem 4.1. Consider the 1D Allen–Cahn equation with periodic or homogeneous Neumann boundary conditions
where , and is the central difference approximation to the second-order spatial derivative. Consider the Strang splitting along with any SRK method when solving the above equation or . Assume . Then under the linear stability constraint of the SRK method for all .
Proof. Notice that for each spatial grid , by assumption, therefore
and therefore the nonlinear update preserves the maximum principle for any . By Theorem 5.7 and Corollary 5.12 in [49], we know that the linear update also preserves the maximum principle, therefore the maximum principle of the Strang splitting follows. □
Remark 4.2. The theorem only works for the most commonly used periodic and homogeneous Neumann boundary conditions. It is known that the RKL methods are not monotonically stable for the homogeneous Dirichlet boundary condition, and therefore cannot be guaranteed to preserve the maximum principle of the Allen–Cahn equation. For the RKG methods, it is conjectured in [48] that they are monotonically stable under the homogeneous Dirichlet boundary condition, while no theoretical proof has been established yet.
Remark 4.3. The above theorem only works for 1D because of the limitation of the theorem in [49]. Nevertheless, numerical evidence suggests that the maximum principle also holds a for 2D regular domain with periodic boundary condition and irregular domains under the Neumann boundary condition. However, direct computations reveal that RKL2 does not always preserve numerical monotonicity in 2D even with the CFL condition.s
Modified energy dissipation for the Allen–Cahn equation
We now prove the modified energy dissipation of the Allen–Cahn equation. For the linear-nonlinear-linear Strang splitting, we are inspired by the work [43, 44], with an inexact solution of the linear part. Since the computational cost of the linear part often dominates the cost of the nonlinear part, we propose a different modified energy for the more practical splitting and prove that it dissipates and converges to the exact energy. New first-order RKL and RKG methods are proposed in order to fit into the proof framework, along with an estimation of the RKG2 method spectrum. Moreover, throughout this section we only require the discrete finite difference Laplacian operator to be real, symmetric, and negative-definite; the domain is not required to be regular.
Linear-Nonlinear-Linear Strang splitting
We begin by considering the linear-nonlinear-linear splitting .
Theorem 4.4 (Modified Energy Dissipation, linear-nonlinear-linear). Define the modified energy as
where
Then under the linear-nonlinear-linear Strang splitting defined above, we have
;
For fixed grid size , converges to uniformly as ; more precisely, for , assuming enough regularity of , we have that
Proof. We will first prove that . By construction, the spectrum of is within ; therefore, we have that is positive semi-definite. The non-negativity of the energy and its dissipation result then directly follows from the proof of Theorem 2.1 in [44]. To show the uniform convergence, we follow the procedure as in [43]. Define ; taking the difference between and and using Taylor expansion,
Notice that for some grid size dependent constant uniformly when the CFL condition is satisfied. By direct calculation, we have that
we can bound the nonlinear part of the energy using the fact that
For the linear part, we can bound the difference by
This completes our proof.
Nonlinear-Linear-Nonlinear Strang splitting
We now consider the more practical nonlinear-linear-nonlinear splitting . If the energy in the previous section is directly used, the proof fails. Therefore, a new non-negative energy is needed, which should ideally converge to the exact Ginzburg–Landau energy. Following the logical arguments in [43] we define a suitable as follows in the proof below.
Theorem 4.5 (Modified Energy Dissipation, nonlinear-linear-nonlinear). For any symmetric positive-definite with spectrum in , define the modified energy as
where the function is defined as in Equation (18). Then under the nonlinear-linear-nonlinear Strang splitting defined above, we have
,
For fixed grid size , converges to uniformly as ; more precisely, for ,
assuming enough regularity of we have that
Remark 4.6. As will be shown in § 6.2.3 and § 6.2.4, the assumptions can be satisfied by modified versions of RKL1 and RKG1. It will also be naturally satisfied by RKL2, but requires some more careful estimations and restrictions for RKG2.
Proof. The non-negativity of can be easily deduced from the non-negativity of and the fact that is positive semi-definite. To show that the modified energy dissipates, set . We know that
so that
Rewriting the above and using direct computation, we find
Also by direct computation and self-adjointness of and the fact that all the eigenvalues of are non-negative, we have that
Multiplying the equation and summing over the grid, and using Taylor expansion of up to second-order, we have that
By noticing that is symmetric positive-definite and noticing that , we can conclude that as desired.
Now we show that the modified energy converges to the exact energy. We will first show that and differ by . By definition we have that ; taking the difference and using Taylor expansion, and by noticing that the norm of discrete Laplacian is bounded for fixed grid size, we have that
Now notice that for some grid size dependent constant uniformly when the CFL condition is satisfied. Then by the same argument as in equations (2.26) and (2.27) of [43], we are done with the nonlinear part convergence.
For the inner product part of the energy, by direct calculation we know that
This completes our proof.
Remark 4.7. The linear-nonlinear-linear energy dissipation utilizes the power of Strang splitting instead of the power of super-time-stepping methods. In fact, any linear stable approximation to the heat equation can be fitted into the proof outline above. The nonlinear-linear-nonlinear Strang splitting energy dissipation, on the other hand, does rely on the fact that the stability polynomial of the second-order SRK methods are (almost) positive-definite.
It is easy to verify all the conditions required in the theorem above, except for the positive-definiteness of the operators for the RKL and RKG methods. We therefore proceed and check the condition in the following two sections, and show that the RKL and RKG methods are indeed able to be fitted into the proof above up to modifications and minor additional timestep constraint.
Positive-definite modified RKL1 and RKG1 methods
Since the nonlinear-linear-nonlinear energy definition and the proof rely on the fact that has spectrum within , we now determine the condition that such an assumption holds. For the RKL1 and RKG1 methods
According to the Legendre and Gegenbauer polynomial properties, is the best possible estimation. Therefore, modifications are needed in order for the first-order methods to have a non-negative spectrum. We then follow the general derivation procedure as in § 5.1 to derive new modified first-order RKL and RKG methods.
For the modified RKL1 method, instead of using the Legendre polynomial, consider the shifted Legendre polynomial , where is the -th order Legendre polynomial. Since the Legendre polynomials satisfy for and , we have that for and . The three-point recurrence relationship is then
Now assume that the stability polynomial takes the form of
For first-order, we can assume that for all and choose as in [46], so that
Plugging the stability polynomial into the three-point recurrence relationship, we obtain that
The modified RKL1 method is then
where
Similarly, we can derive the modified RKG1 method by using the shifted Gegenbauer polynomial
By using exactly the same procedure as above, the RKG1 method can be written as
where
The advantage of these modified RKL1 and RKG1 is that they control the eigenvalues of the stability polynomial to be all non-negative, so that they can be directly fitted into the proof of Theorem 4.5. Moreover, those methods naturally satisfy the discrete maximum principle since the regular RKL1 and RKG1 methods are, under the corresponding boundary condition requirements of the RKL and RKG methods. The drawback of this modified RKL1 is that the maximum possible is only half of the original RKL1 by following the same derivation as in [46], although it still follows the order.
Positive-definiteness estimation for RKL2 and RKG2 methods
We now turn our attention to the second-order RKL and RKG. According to the derivations in [46] and [48], it is not difficult to see that the shifted RKL2 and RKG2 are the same as the usual RKL2 and RKG2, since there are exactly three equations and three unknowns. Therefore, we need to estimate the conditions for RKL2 and RKG2 to give us positive (semi)-definite stability polynomials.
Recall that the stability polynomial for RKL2 is
Notice that for ; since the Legendre polynomial is bounded by 1 when the argument is within , we know that when is within the stability constraint. This shows that RKL2 automatically gives us a positive-definite stability polynomial.
The RKG2 method does not automatically have a positive-definite stability polynomial. Recall that the RKG2 stability polynomial is
Notice that for ; since the Gegenbauer polynomial of degree and has value within , the spectrum of the RKG2 stability polynomial takes values within . Since the most negative values of the Gegenbauer polynomials correspond to argument near with odd, we need to estimate the domain of the Gegenbauer polynomial so that the argument within the polynomial is away from . With more asymptotic analysis and the control of the positions for the zeros of the Gegenbauer polynomial, we manage to show that the characteristic polynomial of RKG2 is “almost positive-definite” in the sense that with a small sacrifice of the discrete timestep size away from the maximum possible discrete timestep size, the RKG2 operator is positive-definite. More precisely, it is shown in the theorem below.
Theorem 4.8 (RKG2 operator is “almost positive-definite”). Consider RKG2 in Equation (14) with parameter , and let denote the largest timestep satisfying the CFL constraint. Then for any , there exists such that for all and , is positive-definite.
Proof. First recall that
where is the standard gamma function [52]. Now arbitrarily fix . Now fix small enough such that where is the right-most root of . Notice that this is attainable via Theorem 4.1 of [53]: for such that are the zeros of the Gegenbauer polynomial , we have that specifically
where denotes the left-most zero of for , and ; since corresponds to the right-most zero of , we can choose small enough to achieve the desired goal.
Notice that the positive-definiteness of the RKG2 operator, with the timestep restriction in the theorem statement, is equivalent to showing that
for that is not close to , and as . This is because the eigenvalues lie in the interval of the form
along with the fact that . Therefore, we will show that eq. (20) holds; more specifically, we will show that after the standard change of variable , it holds for in order to complete our proof.
To conduct the estimation, we dissect the region into three different regimes. We first choose to be specified later.
Regime 1: . For the region for , by the way we construct , naturally so that since always holds.
Regime 2: . In this regime, consider the Mehler–Heine formula [52]
Notice that
Therefore, we have that
By elementary estimation of , we have that for all sufficiently large , for all , or equivalently .
Regime 3: . By theorem 8.21.12 in [52],
where , is the Bessel function of the first kind of order [52]. In our case of , , and the above formula is equivalent to
Using the relationship between and , we have that
By using the fact that for some , we have that
for some constant . Now choose such that ; notice this bound is not circular, as is independent of but depends only on the Bessel function bound uniform constant . The worst case scenario of the bound above occurs at for all with some large enough, so that
Then for such that the error term is also less than in magnitude and the leading term dominates, we get that
This ends our three regime analysis.
Then since we need , we have that . By the RKG2 argument definition, we have that
| RKL2 | RKG2 | |||||||
| -norm | -norm | -norm | -norm | |||||
| Error | Rate | Error | Rate | Error | Rate | Error | Rate | |
| - | - | - | - | - | - | - | - | |
| 1.31e-05 | - | 9.263e-08 | - | 1.304e-05 | - | 9.215e-08 | - | |
| 3.301e-06 | 1.991 | 2.331e-08 | 1.991 | 3.280e-06 | 1.991 | 2.319e-08 | 1.990 | |
| 8.264e-07 | 1.998 | 5.837e-09 | 1.998 | 8.214e-07 | 1.998 | 5.808e-09 | 1.998 | |
| 2.067e-07 | 1.999 | 1.460e-09 | 1.999 | 2.054e-07 | 1.999 | 1.452e-09 | 1.999 | |
| 5.168e-08 | 2.000 | 3.650e-10 | 2.000 | 5.136e-08 | 2.000 | 3.632e-10 | 2.000 |
Table 1. Temporal rate of convergence estimation for the RKL2 and RKG2 methods applied to the Allen–Cahn equation, along with Strang splitting. The convergence rates for both methods are close to 2 as expected.
where is an eigenvalue of the discrete Laplacian operator. Since we want , we need that
where is the maximum eigenvalue in absolute value. Notice that the of the RKG2 method is achieved at because we want to set in this case; therefore, we get that
if we set . As desired, since is a small number, we have that is a small number. This concludes our proof.
Remark 4.9. The above theorem is only a rough estimate; nevertheless, it shows that RKG2 can be controlled away from its most negative value, so that RKG2 with a more restricted timestepping and large enough stage number can be fitted into the proof of Theorem 4.5.
Experimental results
In this section, we present numerical experiments of the RKL2 and RKG2 methods applied to the Allen–Cahn and Cahn–Hilliard equations. For all the Allen–Cahn simulations, we take the nonlinear-linear-nonlinear Strang splitting order written in § 6.2.2. We first verify the second-order convergence rate of the RKL2 and RKG2 methods when applied to the Allen–Cahn and Cahn–Hilliard equations. Following that, we present qualitative results for the Allen–Cahn and Cahn–Hilliard coarsening behaviors, by comparing them with known results in existing papers and random initial condition coarsening. Furthermore, we simulate the Allen–Cahn and the Cahn–Hilliard equations for an -shaped domain; finite difference approximation rather than the Fourier spectral method is used for spatial discretization.
Convergence rate test
We consider the two dimensional Allen–Cahn equation in Equation (1), with . The simulation domain is with periodic boundary condition. The spatial domain is divided into intervals, so the spatial discretization error is smaller than the time discretization error. The initial condition is
We test the order of convergence for the second-order Runge–Kutta–Legendre (RKL2) and Runge–Kutta–Gegenbauer (RKG2) methods, when using Strang splitting. We choose the number of substeps and simulate until . We adopt the standard step-doubling convergence rate estimation since there is no exact solution available;
where if we denote to be the simulated solution with step size at time , and is either -norm or -norm. As shown in Table 1, the rate of convergence for the RKL2 and RKG2 methods in both norms are close to the expected second-order. We test the order of convergence for RKL2 and RKG2 when applied to the Cahn–Hilliard equation, under the same conditions as above up to . The temporal convergence rate is shown in Table 2, with the desired second-order convergence.
| RKL2 | RKG2 | |||||||
| -norm | -norm | -norm | -norm | |||||
| Error | Rate | Error | Rate | Error | Rate | Error | Rate | |
| - | - | - | - | - | - | - | - | |
| 8.529e-08 | - | 5.288e-10 | - | 6.404e-08 | - | 3.971e-10 | - | |
| 2.135e-08 | 1.998 | 1.324e-10 | 1.998 | 1.603e-08 | 1.999 | 9.942e-11 | 1.998 | |
| 5.340e-09 | 1.999 | 3.313e-11 | 1.999 | 4.009e-09 | 1.999 | 2.488e-11 | 1.999 | |
| 1.335e-09 | 2.000 | 8.289e-12 | 1.999 | 1.002e-09 | 2.000 | 6.222e-12 | 1.999 | |
| 3.339e-10 | 2.000 | 2.080e-12 | 1.995 | 2.504e-10 | 2.001 | 1.558e-12 | 1.998 |
Table 2. Temporal rate of convergence estimation for the RKL2 and RKG2 method applied to the Cahn–Hilliard equation. The convergence rates for both methods are close to 2 as expected.
Coarsening process and energy evolution in 2-dimensional space
In this section, we simulate the rescaled Allen–Cahn and Cahn–Hilliard equation
in the domain with periodic boundary condition. We use for all the tests. We first simulate the coarsening behavior to validate our method, by comparing the simulation results to the ones in the existing literature. For the Allen–Cahn equation, we use the initial condition
The spatial grid is , with . We use for RKL2 and for the RKG2 methods so that their stability can be guaranteed, without an excessive number of substeps. We simulate until . As shown in Figure 1, the results are visually indistinguishable between methods and are consistent with Figure 1 in [12]. The maximum principle is also preserved for the simulation.

Figure 1. Allen–Cahn equation coarsening evolution at and , with initial condition Equation (21).
For the Cahn–Hilliard equation, it is verified in [45] that the symmetric sinusoidal initial condition above leads to an unstable evolution. Therefore, we instead use the asymmetric initial condition in [45]
The spatial grid is . We use for RKL2 and for RKG2 to guarantee stability. The timestep is . We again simulate until . The results in Figure 3 agree with Figure 5.12 in [28], and using the fact that the energy and the solution do not change after about .

(a) Cahn–Hilliard simulation, RKL2

(b) Cahn–Hilliard simulation, RKG2
Figure 3. Cahn–Hilliard equation coarsening evolution at , , and , with initial condition Equation (22).
We also compute the energy for the numerical solutions; as shown in Figure 2 and Figure 4, both the Allen–Cahn simulation and the Cahn–Hilliard simulations obtain monotonically decreasing energy curves; the shape and the values of the curves are also similar to the ones in Figure 2 of [13]. For the Allen–Cahn equation, we also compute the modified energy in Equation (19) in addition to the standard energy. For visualization purpose, when plotting the modified energy, we use the exact energy at . As shown in Figure 2, there is no visible difference between the exact energy and the modified energy.
(a) Allen–Cahn equation energy, RKL2
(b) Allen–Cahn equation energy, RKG2
Figure 2. Original energy and modified energy dissipation of the Allen–Cahn equation simulations, with initial condition Equation (21). The modified energy is defined by Equation (19).
(a) Cahn–Hilliard equation energy, RKL2
(b) Cahn–Hilliard equation energy, RKG2
Figure 4. Energy dissipation of the Cahn–Hilliard equation simulations, with initial condition Equation (22).
Then we simulate Allen–Cahn and Cahn–Hilliard equations with random initial conditions. For Allen–Cahn, we use the initial condition
with the same settings as above. For Cahn–Hilliard, we again use an asymmetric random initial condition
where denotes random numbers sampled from uniformly. For Allen–Cahn, the spatial discretization is chosen to be , the timestep is chosen to be , and we simulate until . We still use for the RKL2 method and for the RKG2 method. For Cahn–Hilliard, the spatial discretization is chosen to be , the timestep is chosen to be , and we simulate until . The coarsening parameter is chosen to be . We again use for RKL2 and for RKG2 as in the previous example. Periodic boundary condition is applied. The coarsening behaviors are shown in Figure 5 and Figure 7; as shown, both RKL2 and RKG2 produce visually the same coarsening behaviors. Notice that for consistency, we use the color bar with range for the Cahn–Hilliard equation plots, although some of the simulation values might exceed this range with trivial amount due to the lack of maximum principle; visually the effect is negligible. The energy curves of the methods are shown

Figure 5. Allen–Cahn equation coarsening evolution at , , and , with initial condition Equation (23).

Figure 7. Cahn–Hilliard equation coarsening evolution at , , and , with initial condition Equation (24).
in Figure 6 and Figure 8, both of which are monotonically decreasing. The Allen–Cahn simulations in addition have almost identical energy and modified energy as shown in Figure 6.
Figure 6. Original energy and modified energy dissipation of the Allen–Cahn equation solutions, with initial condition Equation (23). The modified energy is defined by Equation (19).
Figure 8. Energy dissipation of the Cahn–Hilliard equation simulations, with initial condition Equation (24).
Coarsening process and energy evolution in 2-dimensional irregular domain
As discussed in § 4, the exponential time differencing Runge–Kutta (ETDRK) methods in rectangular domains with periodic boundary condition can be solved extremely efficiently, using the Fourier spectral method for spatial discretization. However, it is also known that for irregular domains with non-periodic boundary conditions, Fourier spectral method cannot be applied, and other methods such as Chebyshev or Legendre spectral methods need to be utilized in general [42]. Therefore, RKL and RKG methods are attractive as explicit methods that do not rely on the Fourier spectral approximation. We hence conduct numerical simulations on an -shaped domain for Allen–Cahn and Cahn–Hilliard equations, using RKL and RKG methods; the domain is chosen to be . We again choose the random initial condition Equation (23) and Equation (24), with the same parameters as in the case of rectangular domain. The boundary condition is chosen to be homogeneous Neumann boundary condition. As shown in Figure 9, Figure 11, Figure 10, and Figure 12, the simulations of both methods are visually the same and the energy curves are decreasing. More importantly, the modified energy and the original energy again perfectly match each other, which confirms our claim that the proof of Theorem 4.5 does not rely on the fact that the domain is rectangular.

Figure 9. Allen–Cahn equation coarsening evolution at , , and , within the -shaped irregular domain and initial condition Equation (23).

Figure 10. Energy dissipation of the Allen–Cahn equation simulations on -shaped domain, with initial condition Equation (23). The modified energy is defined by Equation (19).

Figure 11. Cahn–Hilliard equation coarsening evolution at , , and , within the -shaped irregular domain and initial condition Equation (24). As shown, there is no visual difference between the RKL2 and RKG2 simulations.
Figure 12. Energy dissipation of the Cahn–Hilliard equation simulations on -shaped domain, with initial condition Equation (24).
Adaptive time stepping
As can be seen from the previous examples, the phase-field models behavior can drastically change quickly over short timescales while varying very slowly over longer timescales. Various existing methods [45, 12] have utilized adaptive time stepping for faster simulation; we therefore implement adaptive time stepping for the Cahn–Hilliard equation. We use the strategy motivated in in [54], which defines a dimensionless modified local truncation error and calculates the infinity norm of the local truncation error as a criterion. However, if their strategy were directly used in our simulation, division by zero would be (almost) inevitable and would lead to ineffective measurement. We therefore consider the further modified local truncation error
Compared to the original formulation in [54], our formulation first applies the infinity norm to the finite difference errors and , so that the division by zero issue is eliminated.
Another noteworthy component of the adaptive time stepping strategy is the update of number of substeps for the
| Algorithm 1 | Substep changing procedure |
| Require: | Timestep and spatial grid size ; old substep number , method RKL or RKG; case max or min. |
| Step 1: | Compute CFL number . |
| Step 2: | If method is RKL, set . If method is RKG, set . |
| Step 3: | Relax the condition a little bit by setting . If case is max, set . If case is min, set . |
Table 1.
SRK methods. Since the implicit method used in [54] is unconditionally stable, their adaptive time stepping strategy does not need to account for the stability constraint. However, the stability constraints of our SRK methods are fully controlled by the number of substeps , therefore we need to change each time the timestep increases or decreases to avoid redundant or insufficient number of substeps. Since the fourth-order term dominates in the Cahn–Hilliard, we choose our analytically according to the CFL condition given in [46, 48] with a small relaxation. The detailed method for changing is described in Algorithm 1.
We summarize the algorithm described above in Algorithm 2, and conduct Cahn–Hilliard equation simulations accordingly. We choose the adaptive timestep tolerance to be 1e-3 and to be 3. We again choose the Algorithm 2 Adaptive time stepping procedure
Require: Numerical solutions of two steps , ; current and previous timesteps , ; adaptive time tolerance ; small error counting ; maximum number of count .
Step 1: Compute using timestep .
Step 2: Calculate LTE according to Equation (25).
Step 3: If the original energy is not monotone, set and . Set with and case min, then go back to step 1.
Step 4: Else, if LTE , . If reaches , set , , and .
Step 5: Set with and case max, then go back to step 1.
Step 6: Endif.
initial condition to be the perturbed sinusoidal initial condition Equation (22), with the same initial parameters as in the constant timestep case. As shown in Figure 13 and Figure 14, the adaptive time stepping simulations and the energy curves match the constant timestep results in Figure 3 and Figure 4. Moreover, we plot the used for each timestep for both methods in Figure 15; as shown in the figures, the used significantly increases from to . We also conduct a wall-clock comparison of the simulation times. For RKL2 the constant timestep version uses 896.02s, while the adaptive timestep version uses 344.95s. For RKG2, the constant timestep version uses 1185.29s, while the adaptive timestep version uses 502.32s. This shows the effectiveness of our adaptive timestepping strategy in the Cahn–Hilliard equation simulations.

Figure 13. Cahn–Hilliard equation coarsening evolution at (approximately) and , with initial condition Equation (22) and adaptive time stepping. As shown, there is no visual difference between the RKL2 and RKG2 simulations, and the results are similar to the constant timestep simulations in Figure 3.
Figure 14. Energy dissipation of the Cahn–Hilliard equation solutions with adaptive time stepping.

Figure 15. Evolution of over the adaptive time stepping simulation of the Cahn–Hilliard equation, with sinusoidal initial condition Equation (22).
Conclusion
In this paper, we present simulations of Allen–Cahn and Cahn–Hilliard equations using the explicit stabilized Runge–Kutta methods. Theoretical analysis guaranties that the discrete maximum principle is preserved for the Allen–Cahn equation with Strang splitting within the stability constraint. We also prove that the modified discrete energy, under two different ways of splitting, dissipate with a minor tradeoff of maximum timestep allowed, by estimating the positive-definiteness of the stability polynomial. Numerical simulations also verify and validate the rate of convergence and the energy dissipation of both Allen–Cahn and Cahn–Hilliard equations, for both rectangular domains and irregular domains, under periodic and Neumann boundary conditions.
For future work, one can potentially develop higher-order stabilized Runge–Kutta methods specifically designed for gradient flows. Another direction can be to prove dissipation of the original energy for Allen–Cahn and the Cahn–Hilliard equations, or find out the limitation of the methods, since only empirical evidence is provided for 2D maximum principle and Cahn–Hilliard energy dissipation. Moreover, our methods can be applied to higher-order parabolic equations with variable coefficients easily, and gain more efficiency when compared with the implicit methods. Finally, theoretical guarantee of the maximum principle when applying RKG methods to the Allen–Cahn equation with Dirichlet boundary condition can also help us better understand the stabilized Runge–Kutta methods, and it would also be beneficial if the maximum principle for RKL and RKG methods can be proved for more general domain shapes.
Acknowledgment
The work of the second author was supported by the Advanced Simulation and Computing Program (ASC) at Los Alamos National Laboratory, operated by Triad National Security, LLC, for the National Nuclear Security Administration of the U.S. Department of Energy contract 89233218CNA000001. The work of the first and the third author was supported by ONR grant DOD N00014-23-1-2565.
The first author used AI-assisted tools, including ChatGPT and Claude, for support with function visualizations in theorem proving, English language polishing, LaTeX editing, and partial code checking. The third author used Claude for one stage of proofreading but not the final proofreading of the paper, which was checked by a human editor.
References
References
- [1]S. M. Allen, J. W. Cahn, A microscopic theory for antiphase boundary motion and its application to antiphase domain coarsening, Acta Metallurgica 27 (6) (1979) 1085–1095. doi:https://doi.org/10.1016/0001-6160(79)90196-2. URL https://www.sciencedirect.com/science/article/pii/0001616079901962
- [2]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. doi:10.1063/1.1744102.DOI
- [3]L.-Q. Chen, Phase-field models for microstructure evolution, Annual Review of Materials Research 32 (Volume 32, 2002) (2002) 113–140. doi:https://doi.org/10.1146/annurev.matsci.32.112001.132041. URL https://www.annualreviews.org/content/journals/10.1146/annurev.matsci.32.112001.132041
- [4]L. Golubović, A. Levandovsky, D. Moldovan, Interface dynamics and far-from-equilibrium phase transitions in multilayer epitaxial growth and erosion on crystal surfaces: Continuum theory insights, East Asian Journal on Applied Mathematics 1 (4) (2011) 297–371. doi:10.4208/eajam.040411.030611a.DOI
- [5]M. E. Gurtin, D. Polignone, J. Viñals, Two-phase binary fluids and immiscible fluids described by an order parameter, Mathematical Models and Methods in Applied Sciences 06 (06) (1996) 815–831. arXiv:https://doi.org/10.1142/S0218202596000341, doi:10.1142/S0218202596000341. URL https://doi.org/10.1142/S0218202596000341
- [6]O. Penrose, P. C. Fife, Thermodynamically consistent models of phase-field type for the kinetic of phase transitions, Physica D: Nonlinear Phenomena 43 (1) (1990) 44–62. doi:https://doi.org/10.1016/0167-2789(90)90015-H. URL https://www.sciencedirect.com/science/article/pii/016727899090015H
- [7]H. Gomez, L. Cueto-Felgueroso, R. Juanes, Three-dimensional simulation of unstable gravity-driven infiltration of water into a porous medium, Journal of Computational Physics 238 (2013) 217–239. doi:https://doi.org/10.1016/j.jcp.2012.12.018. URL https://www.sciencedirect.com/science/article/pii/S0021999112007498
- [8]D. J. Eyre, Unconditionally gradient stable time marching the Cahn–Hilliard equation, in: Computational & Mathematical Models of Microstructural Evolution, Vol. 529 of MRS Online Proceedings Library, Materials Research Society, 1998, pp. 39–46. doi:10.1557/PROC-529–39.DOI
- [9]U. M. Ascher, S. J. Ruuth, B. T. R. Wetton, Implicit-explicit methods for time-dependent partial differential equations, SIAM Journal on Numerical Analysis 32 (3) (1995) 797–823. arXiv:https://doi.org/10.1137/0732037, doi:10.1137/0732037. URL https://doi.org/10.1137/0732037
- [10]Z. Xu, X. Yang, H. Zhang, Z. Xie, Efficient and linear schemes for anisotropic Cahn–Hilliard model using the stabilized-invariant energy quadratization (S-IEQ) approach, Computer Physics Communications 238 (2019) 36–49. doi:https://doi.org/10.1016/j.cpc.2018.12.019. URL https://www.sciencedirect.com/science/article/pii/S0010465518304417
- [11]J. Shen, J. Xu, J. Yang, The scalar auxiliary variable (SAV) approach for gradient flows, Journal of Computational Physics 353 (2018) 407–416. doi:https://doi.org/10.1016/j.jcp.2017.10.021. URL https://www.sciencedirect.com/science/article/pii/S002199911730774X
- [12]Z. Fu, J. Yang, Energy-decreasing exponential time differencing Runge–Kutta methods for phase-field models, Journal of Computational Physics 454 (2022) 110943. doi:https://doi.org/10.1016/j.jcp.2022.110943. URL https://www.sciencedirect.com/science/article/pii/S0021999122000055
- [13]Q. Du, L. Ju, X. Li, Z. Qiao, Maximum principle preserving exponential time differencing schemes for the nonlocal Allen–Cahn equation, SIAM Journal on Numerical Analysis 57 (2) (2019) 875–898. arXiv:https://doi.org/10.1137/18M118236X, doi:10.1137/18M118236X. URL https://doi.org/10.1137/18M118236X
- [14]Z. Fu, J. Shen, J. Yang, Higher-order energy-decreasing exponential time differencing Runge-Kutta methods for gradient flows, Science China Mathematics 68 (7) (2025) 1727–1746. doi:10.1007/s11425-024-2337-3.DOI
- [15]B. P. Vollmayr-Lee, A. D. Rutenberg, Fast and accurate coarsening simulation with an unconditionally stable time step, Physical Review E 68 (6) (2003) 066703. doi:10.1103/PhysRevE.68.066703.
- [16]N. Zheng, J. Shen, Stability and error analysis of linear imex schemes for sixth-order Cahn–Hilliard-type equations, Communications in Nonlinear Science and Numerical Simulation 145 (2025) 108724. doi:https://doi.org/10.1016/j.cnsns.2025.108724. URL https://www.sciencedirect.com/science/article/pii/S1007570425001352
- [17]Z. Fu, T. Tang, J. Yang, Energy diminishing implicit-explicit Runge–Kutta methods for gradient flows, Mathematics of Computation 93 (2024) 2745–2767. doi:10.1090/mcom/3509.
- [18]J. Shen, X. Yang, Numerical approximations of Allen-Cahn and Cahn-Hilliard equations (2010). doi:10.3934/dcds.2010.28.1669. URL https://www.aimsciences.org/article/id/b4cba61a-377b-449a-b226-e85e2c00cc6aDOI
- [19]X. Yang, Linear, first and second-order, unconditionally energy stable numerical schemes for the phase field model of homopolymer blends, Journal of Computational Physics 327 (2016) 294–316. doi:https://doi.org/10.1016/j.jcp.2016.09.029. URL https://www.sciencedirect.com/science/article/pii/S0021999116304508
- [20]X. Yang, Efficient, second-order in time, and energy stable scheme for a new hydrodynamically coupled three components volume-conserved Allen–Cahn phase-field model, Mathematical Models and Methods in Applied Sciences 31 (04) (2021) 753–787. arXiv:https://doi.org/10.1142/S0218202521500184, doi:10.1142/S0218202521500184. URL https://doi.org/10.1142/S0218202521500184
- [21]X. Yang, L. Ju, Efficient linear schemes with unconditional energy stability for the phase field elastic bending energy model, Computer Methods in Applied Mechanics and Engineering 315 (2017) 691–712. doi:https://doi.org/10.1016/j.cma.2016.10.041. URL https://www.sciencedirect.com/science/article/pii/S0045782516306016
- [22]X. Yang, L. Ju, Linear and unconditionally energy stable schemes for the binary fluid–surfactant phase field model, Computer Methods in Applied Mechanics and Engineering 318 (2017) 1005–1029. doi:https://doi.org/10.1016/j.cma.2017.02.011. URL https://www.sciencedirect.com/science/article/pii/S0045782516317856
- [23]X. Yang, J. Zhao, X. He, Linear, second order and unconditionally energy stable schemes for the viscous Cahn–Hilliard equation with hyperbolic relaxation using the invariant energy quadratization method, Journal of Computational and Applied Mathematics 343 (2018) 80–97. doi:https://doi.org/10.1016/j.cam.2018.04.027. URL https://www.sciencedirect.com/science/article/pii/S0377042718302085
- [24]X. Yang, J. Zhao, Q. Wang, Numerical approximations for the molecular beam epitaxial growth model based on the invariant energy quadratization method, Journal of Computational Physics 333 (2017) 104–127. doi:https://doi.org/10.1016/j.jcp.2016.12.025. URL https://www.sciencedirect.com/science/article/pii/S0021999116306799
- [25]X. Yang, J. Zhao, Q. Wang, J. Shen, Numerical approximations for a three-component Cahn–Hilliard phase-field model based on the invariant energy quadratization method, Mathematical Models and Methods in Applied Sciences 27 (11) (2017) 1993–2030.DOI
- [26]H. Yu, X. Yang, Numerical approximations for a phase-field moving contact line model with variable densities and viscosities, Journal of Computational Physics 334 (2017) 665–686. doi:https://doi.org/10.1016/j.jcp.2017.01.026. URL https://www.sciencedirect.com/science/article/pii/S0021999117300426
- [27]X. Bai, J. Sun, J. Shen, W. Yao, Z. Guo, A Ginzburg–Landau-$H^{-1}$ model and its SAV algorithm for image inpainting, Journal of Scientific Computing 96 (2) (2023) 40. doi:10.1007/s10915-023-02252-z. URL https://doi.org/10.1007/s10915-023-02252-z
- [28]Q. Cheng, C. Liu, J. Shen, A new Lagrange multiplier approach for gradient flows, Computer Methods in Applied Mechanics and Engineering 367 (2020) 113070. doi:https://doi.org/10.1016/j.cma.2020.113070. URL https://www.sciencedirect.com/science/article/pii/S0045782520302541
- [29]Q. Cheng, C. Liu, J. Shen, Generalized SAV approaches for gradient systems, Journal of Computational and Applied Mathematics 394 (2021) 113532. doi:https://doi.org/10.1016/j.cam.2021.113532. URL https://www.sciencedirect.com/science/article/pii/S0377042721001515
- [30]Q. Cheng, J. Shen, C. Wang, Unique solvability and error analysis of a scheme using the Lagrange multiplier approach for gradient flows, SIAM Journal on Numerical Analysis 63 (2) (2025) 772–799. arXiv:https://doi.org/10.1137/24M1659303,doi:10.1137/24M1659303. URL https://doi.org/10.1137/24M1659303
- [31]Y. Di, Y. Ma, J. Shen, J. Zhang, A variable time-step IMEX-BDF2 SAV scheme and its sharp error estimate for the Navier–Stokes equations, ESAIM: Mathematical Modelling and Numerical Analysis 57 (3) (2023) 1143–1170. doi:10.1051/m2an/2023007. URL https://doi.org/10.1051/m2an/2023007
- [32]X. Huang, J. Shen, Bound/positivity preserving SAV schemes for the Patlak-Keller-Segel-Navier-Stokes system, Journal of Computational Physics 480 (2023) 112034. doi:https://doi.org/10.1016/j.jcp.2023.112034. URL https://www.sciencedirect.com/science/article/pii/S0021999123001298
- [33]X. Li, J. Shen, Error estimate of a consistent splitting GSAV scheme for the Navier-Stokes equations, Applied Numerical Mathematics 188 (2023) 62–74. doi:https://doi.org/10.1016/j.apnum.2023.03.004. URL https://www.sciencedirect.com/science/article/pii/S0168927423000661
- [34]X. Liu, J. Shen, N. Zheng, Efficient energy stable numerical schemes for Cahn–Hilliard equations with dynamical boundary conditions, Journal of Computational Physics 509 (2024) 113037. doi:https://doi.org/10.1016/j.jcp.2024.113037. URL https://www.sciencedirect.com/science/article/pii/S0021999124002869
- [35]Z. Liu, Y. Zhang, X. Li, A novel energy-optimized technique of SAV-based (EOP-SAV) approaches for dissipative systems, Journal of Scientific Computing 101 (2) (2024) 38. doi:10.1007/s10915-024-02677-0. URL https://doi.org/10.1007/s10915-024-02677-0
- [36]J. Shen, J. Xu, J. Yang, A new class of efficient and robust energy stable schemes for gradient flows, SIAM Review 61 (3) (2019) 474–506. arXiv:https://doi.org/10.1137/17M1150153, doi:10.1137/17M1150153. URL https://doi.org/10.1137/17M1150153
- [37]Y. Zhang, J. Shen, A generalized SAV approach with relaxation for dissipative systems, Journal of Computational Physics 464 (2022) 111311. doi:https://doi.org/10.1016/j.jcp.2022.111311. URL https://www.sciencedirect.com/science/article/pii/S0021999122003734
- [38]M. Hochbruck, A. Ostermann, Exponential integrators, Acta Numerica 19 (2010) 209–286. doi:10.1017/S0962492910000048.DOI
- [39]S. Cox, P. Matthews, Exponential time differencing for stiff systems, Journal of Computational Physics 176 (2) (2002) 430–455. doi:https://doi.org/10.1006/jcph.2002.6995. URL https://www.sciencedirect.com/science/article/pii/S0021999102969950
- [40]Q. Du, L. Ju, X. Li, Z. Qiao, Maximum bound principles for a class of semilinear parabolic equations and exponential time-differencing schemes, SIAM Review 63 (2) (2021) 317–359. arXiv:https://doi.org/10.1137/19M1243750, doi:10.1137/19M1243750. URL https://doi.org/10.1137/19M1243750
- [41]Y. Liu, C. Quan, D. Wang, On the maximum bound principle and energy dissipation of exponential time differencing methods for the matrix-valued Allen–Cahn equation, IMA Journal of Numerical Analysis (2024) drae090arXiv:https://academic.oup.com/imajna/advance-article-pdf/doi/10.1093/imanum/drae090/61251649/drae090.pdf, doi:10.1093/imanum/drae090. URL https://doi.org/10.1093/imanum/drae090
- [42]J. Shen, T. Tang, L.-L. Wang, Spectral methods: algorithms, analysis and applications, Vol. 41, Springer Science & Business Media, 2011.DOI
- [43]D. Li, C. Quan, J. Xu, Stability and convergence of Strang splitting. Part I: Scalar Allen-Cahn equation, Journal of Computational Physics 458 (2022) 111087. doi:https://doi.org/10.1016/j.jcp.2022.111087. URL https://www.sciencedirect.com/science/article/pii/S0021999122001498
- [44]M. Gao, C. Quan, Z. Zhang, Convergence analysis of a novel Strang directional splitting method for the Allen–Cahn equations, Journal of Computational and Applied Mathematics 473 (2026) 116868. doi:https://doi.org/10.1016/j.cam.2025.116868. URL https://www.sciencedirect.com/science/article/pii/S0377042725003826
- [45]Y. Cheng, A. Kurganov, Z. Qu, T. Tang, Fast and stable explicit operator splitting methods for phase-field models, Journal of Computational Physics 303 (2015) 45–65. doi:https://doi.org/10.1016/j.jcp.2015.09.005. URL https://www.sciencedirect.com/science/article/pii/S0021999115005859
- [46]C. D. Meyer, D. S. Balsara, T. D. Aslam, A stabilized Runge–Kutta–Legendre method for explicit super-time-stepping of parabolic and mixed equations, Journal of Computational Physics 257 (2014) 594–626. doi:https://doi.org/10.1016/j.jcp.2013.08.021. URL https://www.sciencedirect.com/science/article/pii/S0021999113005597
- [47]S. O’Sullivan, Runge–Kutta–Gegenbauer explicit methods for advection-diffusion problems, Journal of Computational Physics 388 (2019) 209–223. doi:https://doi.org/10.1016/j.jcp.2019.03.001. URL https://www.sciencedirect.com/science/article/pii/S0021999119301706
- [48]T. Skaras, T. Saxton, C. Meyer, T. D. Aslam, Super-time-stepping schemes for parabolic equations with boundary conditions, Journal of Computational Physics 425 (2021) 109879. doi:https://doi.org/10.1016/j.jcp.2020.109879. URL https://www.sciencedirect.com/science/article/pii/S0021999120306537
- [49]Z. Tan, T. D. Aslam, A. L. Bertozzi, Explicit monotone stable super-time-stepping methods for finite time singularities, SIAM Journal on Applied Mathematics 86 (2) (2026) 457–481. arXiv:https://epubs.siam.org/doi/pdf/10.1137/25M1747646, doi:10.1137/25M1747646. URL https://epubs.siam.org/doi/abs/10.1137/25M1747646DOI
- [50]Z. Tan, W. Wang, A. L. Bertozzi, E. K. Ryu, STORK: Faster diffusion and flow matching sampling by resolving both stiffness and structure-dependence, in: The Fourteenth International Conference on Learning Representations, 2026. URL https://openreview.net/forum?id=Ce0IVXM14rarxiv.org/abs/2505.24210
- [51]G. Strang, On the construction and comparison of difference schemes, SIAM Journal on Numerical Analysis 5 (3) (1968) 506–517. arXiv:https://doi.org/10.1137/0705041, doi:10.1137/0705041. URL https://doi.org/10.1137/0705041
- [52]G. Szegő, Orthogonal Polynomials, American Math. Soc: Colloquium publ, American Mathematical Society, 1975. URL https://books.google.com/books?id=2phzwgEACAAJ
- [53]L. Gatteschi, On the zeros of Jacobi polynomials and Bessel functions, in: International conference on special functions: theory and computation (Turin, 1984). Rend. Sem. Mat. Univ. Politec. Torino (Special Issue), 1985, pp. 149–177.
- [54]T. Kostić, A. L. Bertozzi, Statistical density estimation using threshold dynamics for geometric motion, Journal of Scientific Computing 54 (2-3) (2013) 513–530. doi:10.1007/s10915-012-9615-6.DOI







