@Article{JCM-42-5,
author = {Minghua, Chen and Yu, Fan and Zhang, Qingdong and Zhimin, Zhang},
title = {Variable Step-Size BDF3 Method for Allen-Cahn Equation},
journal = {Journal of Computational Mathematics},
year = {2024},
volume = {42},
number = {5},
pages = {1380--1406},
abstract = {<p style="text-align: justify;">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 $r_k :=\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.</p>},
issn = {1991-7139},
doi = {https://doi.org/10.4208/jcm.2304-m2022-0140},
url = {https://global-sci.com/article/91101/variable-step-size-bdf3-method-for-allen-cahn-equation}
}