Controlling the accuracy of unconditionally stable algorithms in Cahn-Hilliard Equation
Abstract
Description
Given an unconditionally stable algorithm for solving the Cahn-Hilliard equation, we present a general calculation for an analytic time step $\d τ$ in terms of an algorithmic time step $\dt$. By studying the accumulative multi-step error in Fourier space and controlling the error with arbitrary accuracy, we determine an improved driving scheme $\dt=At^{2/3}$ and confirm the numerical results observed in a previous study \cite{Cheng1}.
4 pages, latex
4 pages, latex