Maximally-fast coarsening algorithms
Abstract
Description
We present maximally-fast numerical algorithms for conserved coarsening systems that are stable and accurate with a growing natural time-step $Δt=A t_s^{2/3}$. For non-conserved systems, only effectively finite timesteps are accessible for similar unconditionally stable algorithms. We compare the scaling structure obtained from our maximally-fast conserved systems directly against the standard fixed-timestep Euler algorithm, and find that the error scales as $\sqrt{A}$ -- so arbitrary accuracy can be achieved.
5 pages, 3 postscript figures, Latex
5 pages, 3 postscript figures, Latex