Variable step-size bdf3 method for allen-cahn equation

JOURNAL OF COMPUTATIONAL MATHEMATICS(2023)

Cited 2|Views0
No score
Abstract
In this work, we analyze the three-step backward differentiation formula (BDF3) method for solving the Allen-Cahn equation on variable grids. For BDF2 method, the discrete orthogonal convolution (DOC) kernels are positive, the stability and convergence analysis are well established in [Liao and Zhang, Math. Comp., 90 (2021), 1207-1226] and [Chen, Yu, and Zhang, arXiv:2108.02910, 2021]. However, the numerical analysis for BDF3 method with variable steps seems to be highly nontrivial due to the additional degrees of freedom and the non-positivity of DOC kernels. By developing a novel spectral norm inequality, the unconditional stability and convergence are rigorously proved under the updated step ratio restriction rk := tau k/tau k-1 <= 1.405 for BDF3 method. Finally, numerical experiments are performed to illustrate the theoretical results. To the best of our knowledge, this is the first theoretical analysis of variable steps BDF3 method for the Allen-Cahn equation.
More
Translated text
Key words
Variable step-size BDF3 method,Allen-Cahn equation,Spectral norm inequal ity,Stability and convergence analysis
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined