arXiv · cond-mat/0507033
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 $Δ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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Mowei Cheng, Andrew Rutenberg. 2005-07-01. Maximally-fast coarsening algorithms. https://doi.org/10.1103/physreve.72.055701
Cite the original work for its findings. Save a collection to share your selection of sources.