Maximally-fast coarsening algorithms
arXiv:cond-mat/0507033 · doi:10.1103/PhysRevE.72.055701
Abstract
We present maximally-fast numerical algorithms for conserved coarsening systems that are stable and accurate with a growing natural time-step . 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 -- so arbitrary accuracy can be achieved.
5 pages, 3 postscript figures, Latex