Numerical methods for Chaotic ODE
Robert M. Corless
TL;DR
The paper investigates backward error analysis for chaotic ODEs through residual analysis, the method of modified equations, and shadowing, arguing that numerical solutions effectively solve a persistently disturbed system $\dot{Y}=F(Y)+\varepsilon v(t)$ and that many attractor statistics remain robust despite exponential trajectory divergence. It demonstrates with the Lorenz and Henon–Heiles models how residuals and Hamiltonian structure influence backward error, and discusses the role and limits of shadowing and structure-preserving integrators in preserving correct statistics. A key message is practical: use variable steps and tolerance checks, monitor residuals and conserved quantities to detect spurious behavior, and recognize that exact trajectory convergence cannot be guaranteed in chaotic regimes, though statistics can still be trustworthy. The work also highlights open questions about the typicality of shadowing orbits in long-time simulations and the interplay between numerical perturbations and physical invariants. These insights have practical impact for scientists performing long-time chaotic simulations, guiding the choice of integrators and diagnostic checks to assess reliability of computed statistics.
Abstract
This paper explores backward error analysis for numerical solutions of ordinary differential equations, particularly focusing on chaotic systems. Three approaches are examined: residual assessment, the method of modified equations, and shadowing. We investigate how these methods explain the success of numerical simulations in capturing the behavior of chaotic systems, even when facing issues like spurious chaos introduced by numerical methods or suppression of chaos by numerical methods. Finally, we point out an open problem, namely to explain why the statistics of long orbits are usually correct, even though we do not have a theoretical guarantee why this should be so.
