On the Conjecture of Stability Preservation in Arbitrary-Order Adams-Bashforth-Type Integrators
This work addresses stability issues in numerical methods for PDEs, providing theoretical insights for researchers in computational mathematics, though it is incremental as it builds on prior schemes.
This paper disproves a conjecture that a high-order explicit time stepping scheme remains stable as accuracy approaches infinity, showing it loses one order of accuracy, and presents a criterion for maximum permissible accuracy given a stability radius.
This paper presents stability and accuracy analysis of a high-order explicit time stepping scheme introduced by \cite[Section 2.2]{Buvoli2019}, which exhibits superior stability compared to classical Adams-Bashforth. A conjecture that is supported by several numerical phenomena in \cite[Figure 2.5]{Buvoli2018}, the method appears to remain stable when the accuracy approaches infinity, although it is not yet proven. We have disproven this conjecture from the perspective of harmonic analysis in this work. Notwithstanding the aforementioned, this method displays considerably enhanced stability in comparison to conventional explicit schemes. Furthermore, we present a criterion for ascertaining the maximum permissible accuracy for a given specific parabolic stability radius. Conversely, the original method will lose one order associated with the expected accuracy, which can be explored theoretically. Consequently, a unified analysis strategy for the \( L^2 \)-stability will be presented for extensional PDEs under the CFL condition. Finally, a selection of representative numerical examples will be shown in order to substantiate the theoretical analysis.