Controlling the accuracy of unconditionally stable algorithms in Cahn-Hilliard Equation
arXiv:cond-mat/0609354 · doi:10.1103/PhysRevE.75.017702
Abstract
Given an unconditionally stable algorithm for solving the Cahn-Hilliard equation, we present a general calculation for an analytic time step $\d τ$ in terms of an algorithmic time step $\dt$. By studying the accumulative multi-step error in Fourier space and controlling the error with arbitrary accuracy, we determine an improved driving scheme $\dt=At^{2/3}$ and confirm the numerical results observed in a previous study \cite{Cheng1}.
arXiv comment4 pages, latex
References in corpus (7)
- Theory of Phase Ordering Kinetics
- Modeling Elasticity in Crystal Growth
- Modeling Elastic and Plastic Deformations in Non-Equilibrium Processing Using Phase Field Crystals
- Growth Laws for Phase Ordering
- Fast and Accurate Coarsening Simulation with an Unconditionally Stable Time Step
- The Energy-Scaling Approach to Phase-Ordering Growth Laws
- Maximally-fast coarsening algorithms