Numerical precession in variational discretizations of the Kepler problem
Mats Vermeeren

TL;DR
This paper analyzes the numerical precession observed in simulations of the Kepler problem and introduces new integrators that reduce this precession by leveraging Lagrangian structure and perturbative Noether's theorem.
Contribution
It provides leading order estimates of precession for MP and SV methods and develops new integrators with improved accuracy for the Kepler problem.
Findings
Leading order precession estimates for MP and SV methods
New integrators outperform MP and SV in reducing precession
Enhanced numerical stability and accuracy in Kepler simulations
Abstract
Kepler's first law states that the orbit of a point mass with negative energy in a classical gravitational potential is an ellipse with one of its foci at the gravitational center. In numerical simulations of this system one often observes a slight precession of the ellipse around the gravitational center. Using the Lagrangian structure of modified equations and a perturbative version of Noether's theorem, we provide leading order estimates of this precession for the implicit MidPoint rule (MP) and the St\"ormer-Verlet method (SV). Based on those estimates we construct some new numerical integrators that perform significantly better than MP and SV on the Kepler problem.
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 · Matrix Theory and Algorithms
