Controlling the accuracy of unconditionally stable algorithms in Cahn-Hilliard Equation
Abstract
Given an unconditionally stable algorithm for solving the Cahn-Hilliard equation, we present a general calculation for an analytic time step τ in terms of an algorithmic time step . By studying the accumulative multi-step error in Fourier space and controlling the error with arbitrary accuracy, we determine an improved driving scheme =At2/3 and confirm the numerical results observed in a previous study Cheng1.
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.