Abstract
In this paper, a novel framework for constructing the temporal high-order numerical schemes that inherit the maximum bound principle (MBP) of the Allen-Cahn equation is proposed. The original Allen-Cahn equation is converted into an equivalent system by introducing an auxiliary variable. Based on the new system, we put forward and analyze high-order (up to the fourth-order) additive partitioned Runge-Kutta (APRK) schemes for the time integration of the Allen-Cahn equation, which satisfies the discrete MBP under reasonable time step constraints. A simple sufficient condition is also given to ensure that a class of APRK methods preserves the discrete MBP and that the resulting scheme is linearly implicit. The convergence order in the discrete L∞-norm is further provided by utilizing the established discrete MBP, which plays a vital role in the analysis. Several numerical experiments are carried out to validate our theoretical results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
