Fast and accurate coarsening simulation with an unconditionally stable time step

We present Cahn-Hilliard and Allen-Cahn numerical integration algorithms that are unconditionally stable and so provide significantly faster accuracy-controlled simulation. Our stability analysis is based on Eyre’s theorem and unconditional von Neumann stability analysis, both of which we present. Numerical tests confirm the accuracy of the von Neumann approach, which is straightforward and should be widely applicable in phase-field modeling. For the Cahn-Hilliard case, we show that accuracy can be controlled with an unbounded time step Δt that grows with time t as Δt∼t^α. We develop a classification scheme for the step exponent α and demonstrate that a class of simple linear algorithms gives α=1/3. For this class the speedup relative to a fixed time step grows with N, the linear size of the system, as N/lnN. With conservative choices for the parameters controlling accuracy and finite-size effects we find that an 8192² lattice can be integrated 300 times faster than with the Euler method.