On theoretical upper limits for valid timesteps of implicit ODE methods
K. R. Green, G. W. Patrick, R. J. Spiteri

TL;DR
This paper investigates the theoretical maximum timestep size for implicit ODE methods to ensure convergence to valid, consistent solutions, especially in constant timestep simulations of complex systems.
Contribution
It establishes the concept of a critical timestep as an upper bound for valid implicit ODE solutions, highlighting issues in constant timestep scenarios.
Findings
Critical timestep bounds for implicit methods
Implications for simulations of symplectic systems
Limitations of standard step-size control
Abstract
Implicit methods for the numerical solution of initial-value problems may admit multiple solutions at any given time step. Accordingly, their nonlinear solvers may converge to any of these solutions. Below a critical timestep, exactly one of the solutions (the consistent solution) occurs on a solution branch (the principal branch) that can be continuously and monotonically continued back to zero timestep. Standard step-size control can promote convergence to consistent solutions by adjusting the timestep to maintain an error estimate below a given tolerance. However, simulations for symplectic systems or large physical systems are often run with constant timesteps and are thus more susceptible to convergence to inconsistent solutions. Because simulations cannot be reliably continued from inconsistent solutions, the critical timestep is a theoretical upper bound for valid timesteps.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical methods for differential equations · Advanced Numerical Methods in Computational Mathematics · Model Reduction and Neural Networks
