Abstract
We present several first-order and second-order numerical schemes for the Cahn–Hilliard equation with unconditional energy stability in terms of a discrete energy. These schemes stem from the generalized Positive Auxiliary Variable (gPAV) idea, and require only the solution of linear algebraic systems with a constant coefficient matrix. More importantly, the computational complexity (operation count per time step) of these schemes is approximately a half of those of the gPAV and the scalar auxiliary variable (SAV) methods in previous works. We investigate the stability properties of the proposed schemes to establish stability bounds for the field function and the auxiliary variable, and also provide their error analyses. Numerical experiments are presented to verify the theoretical analyses and also demonstrate the stability of the schemes at large time step sizes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Computer Methods in Applied Mechanics and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.