Controlling the accuracy of unconditionally stable algorithms in Cahn-Hilliard Equation
Mowei Cheng, James A. Warren
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.
Create a lesson
Related papers
Temperature dependence of the charge density from first principles: application to the (222) forbidden reflection in silicon
Jean Paul Nery, Raveena Gupta, Olle Hellman et al.
Coupled anisotropic weak topological states and Floquet mixed-parity altermagnetism in two-dimensional Su-Schrieffer-Heeger models
Kunyuan Feng, Xibin Liu, Chenchen Liu et al.
Grain Boundary Phase Transitions Enable Diffusionless Climb of Disconnections
Md Sharier Nazim, Giacomo Po, Nikhil Chandra Admal
3D Cloud Component Analysis of Atomic Structures
Pai Li
Benchmarking of Fast and Interpretable UF Machine Learning Potentials
Pawan Prakash, Sam Dong, Richard G. Hennig
Grain-Boundary Premelting in High-Entropy Transition Metal Carbides
Marium M. Mou, Caleb Schenck, Samuel E. Daigle et al.