Comment on "An efficient code to solve the Kepler equation. Elliptic case"
Daniele Tommasini, David N. Olivieri

TL;DR
This paper critically evaluates a recent method for solving the elliptic Kepler equation, correcting misconceptions about achievable accuracy and providing limits for the error based on eccentricity, with implications for designing more precise algorithms.
Contribution
It analytically and numerically demonstrates the true accuracy limits of Newton-Raphson methods for Kepler's equation, correcting prior claims and extending the analysis to hyperbolic cases.
Findings
The accuracy limit is approximately ε/√(2(1-e)) for high eccentricities.
Errors diverge as eccentricity approaches 1, contrary to previous claims.
Provides guidelines for developing more accurate Kepler equation solvers.
Abstract
In a recent MNRAS article, Raposo-Pulido and Pelaez (RPP) designed a scheme for obtaining very close seeds for solving the elliptic Kepler Equation with the classical and the modified Newton-Rapshon methods. This implied an important reduction in the number of iterations needed to reach a given accuracy. However, RPP also made strong claims about the errors of their method that are incorrect. In particular, they claim that their accuracy can always reach the level , where is the machine epsilon (e.g. in double precision), and that this result is attained for all values of the eccentricity and the mean anomaly , including for and that are arbitrarily close to and , respectively. However, we demonstrate both numerically and analytically that any implementation of the classical or modified…
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.
