Long-time behavior of multi-step Finite Difference schemes with boundary via steepest descent and analytic combinatorics
Abstract
We demonstrate how steepest descent arguments and singularity analysis from analytic combinatorics allow for an accurate description of the behavior of linear numerical schemes -- including the notorious leap-frog scheme -- in presence of stable and unstable boundary conditions in the long-time limit.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.