Maximally fast coarsening algorithms

Abstract

We present maximally fast numerical algorithms for conserved coarsening systems that are stable and accurate with a growing natural time step Deltat=At2/3s. We compare the scaling structure obtained from our maximally fast conserved systems directly against the standard fixed time-step Euler algorithm, and find that the error scales as square root of A--so arbitrary accuracy can be achieved. For nonconserved systems, only effectively finite time steps are accessible for similar unconditionally stable algorithms.