A Second Order BDF Numerical Scheme with Variable Steps for the Cahn-Hilliard Equation

We present and analyze a second order in time variable step BDF2 numerical scheme for the Cahn-Hilliard equation. the construction relies on a second order backward difference, convex-splitting technique and viscous regularizing at the discrete level. We show that the scheme is unconditionally stable and uniquely solvable. in addition, under mild restriction on the ratio of adjacent time-steps, an optimal second order in time convergence rate is established. the proof involves a novel generalized discrete Gronwall-type inequality. as far as we know, this is the first rigorous proof of second order convergence for a variable step BDF2 scheme, even in the linear case, without severe restriction on the ratio of adjacent time-steps. Results of our numerical experiments corroborate our theoretical analysis

Arbitrarily High-Order Unconditionally Energy Stable Schemes for Thermodynamically Consistent Gradient Flow Models

We present a systematic approach to developing arbitrarily high-order, unconditionally energy stable numerical schemes for thermodynamically consistent gradient flow models that satisfy energy dissipation laws. Utilizing the energy quadratization method, we formulate the gradient flow model into an equivalent form with a corresponding quadratic free energy functional. Based on the equivalent form with a quadratic energy, we propose two classes of energy stable numerical approximations. In the first approach, we use a prediction-correction strategy to improve the accuracy of linear numerical schemes. In the second approach, we adopt the Gaussian collocation method to discretize the equivalent form with a quadratic energy, arriving at an arbitrarily high-order scheme for gradient flow models. Schemes derived using both approaches are proved rigorously to be unconditionally energy stable. The proposed schemes are then implemented in four gradient flow models numerically to demonstrate their accuracy and effectiveness. Detailed numerical comparisons among these schemes are carried out as well. These numerical strategies are rather general so that they can be readily generalized to solve any thermodynamically consistent PDE models

Method of Lines Transpose: Energy Gradient Flows Using Direct Operator Inversion for Phase-Field Models

In this work, we develop an $\mathcal{O}(N)$ implicit real space method in 1D and 2D for the Cahn--Hilliard (CH) and vector Cahn--Hilliard (VCH) equations, based on the method of lines transpose (MOL$^{T}$) formulation. This formulation results in a semidiscrete time stepping algorithm, which we prove is gradient stable in the $H^{-1}$ norm. The spatial discretization follows from dimensional splitting and an $\mathcal{O}(N)$ matrix-free solver, which applies fast convolution to the modified Helmholtz equation. We propose a novel factorization technique, in which fourth-order spatial derivatives are incorporated into the solver. The splitting error is included in the nonlinear fixed point iteration, resulting in a high-order, logically Cartesian (line-by-line) update. Our method is fast but not restricted to periodic boundaries like the fast Fourier transform (FFT). The basic solver is implemented using the backward Euler formulation, and we extend this to both backward difference formula (BDF) stencils, singly diagonal implicit Runge--Kutta (SDIRK), and spectral deferred correction (SDC) frameworks to achieve high orders of temporal accuracy. We demonstrate with numerical results that the CH and VCH equations maintain gradient stability in one and two spatial dimensions. We also explore time-adaptivity, so that meta-stable states and ripening events can be simulated both quickly and efficiently

A Robust Solver for a Second Order Mixed Finite Element Method for the Cahn-Hilliard Equation

We develop a robust solver for a second order mixed finite element splitting scheme for the Cahn-Hilliard equation. This work is an extension of our previous work in which we developed a robust solver for a first order mixed finite element splitting scheme for the Cahn-Hilliard equaion. The key ingredient of the solver is a preconditioned minimal residual algorithm (with a multigrid preconditioner) whose performance is independent of the spacial mesh size and the time step size for a given interfacial width parameter. The dependence on the interfacial width parameter is also mild.Comment: 17 pages, 3 figures, 4 tables. arXiv admin note: substantial text overlap with arXiv:1709.0400

Method of Lines Transpose: Energy Gradient Flows Using Direct Operator Inversion for Phase-Field Models

In this work, we develop an $\mathcal{O}(N)$ implicit real space method in 1D and 2D for the Cahn--Hilliard (CH) and vector Cahn--Hilliard (VCH) equations, based on the method of lines transpose (MOL$^{T}$) formulation. This formulation results in a semidiscrete time stepping algorithm, which we prove is gradient stable in the $H^{-1}$ norm. The spatial discretization follows from dimensional splitting and an $\mathcal{O}(N)$ matrix-free solver, which applies fast convolution to the modified Helmholtz equation. We propose a novel factorization technique, in which fourth-order spatial derivatives are incorporated into the solver. The splitting error is included in the nonlinear fixed point iteration, resulting in a high-order, logically Cartesian (line-by-line) update. Our method is fast but not restricted to periodic boundaries like the fast Fourier transform (FFT). The basic solver is implemented using the backward Euler formulation, and we extend this to both backward difference formula (BDF) stencils, singly diagonal implicit Runge--Kutta (SDIRK), and spectral deferred correction (SDC) frameworks to achieve high orders of temporal accuracy. We demonstrate with numerical results that the CH and VCH equations maintain gradient stability in one and two spatial dimensions. We also explore time-adaptivity, so that meta-stable states and ripening events can be simulated both quickly and efficiently

A linear second-order maximum bound principle-preserving BDF scheme for the Allen-Cahn equation with general mobility

In this paper, we propose and analyze a linear second-order numerical method for solving the Allen-Cahn equation with general mobility. The proposed fully-discrete scheme is carefully constructed based on the combination of first and second-order backward differentiation formulas with nonuniform time steps for temporal approximation and the central finite difference for spatial discretization. The discrete maximum bound principle is proved of the proposed scheme by using the kernel recombination technique under certain mild constraints on the time steps and the ratios of adjacent time step sizes. Furthermore, we rigorously derive the discrete $H^{1}$ error estimate and energy stability for the classic constant mobility case and the $L^{\infty}$ error estimate for the general mobility case. Various numerical experiments are also presented to validate the theoretical results and demonstrate the performance of the proposed method with a time adaptive strategy.Comment: 25pages, 5 figure