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 ts2/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 A -- so arbitrary accuracy can be achieved.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.