• DOI:10.1093/MNRAS/STX138
• Corpus ID: 126249801

An efficient code to solve the Kepler equation. Elliptic case

@article{RaposoPulido2017AnEC,
  title={An efficient code to solve the Kepler equation. Elliptic case},
  author={Virginia Raposo-Pulido and Jes{\'u}s Pel{\'a}ez},
  journal={Monthly Notices of the Royal Astronomical Society},
  year={2017},
  volume={467},
  pages={1702-1713}
}

• V. Raposo-Pulido, J. Peláez
• Published 21 May 2017
• Physics
• Monthly Notices of the Royal Astronomical Society

A new approach for solving Kepler equation for elliptical orbits is developed in this paper. This new approach takes advantage of the very good behaviour of the modified Newton?Raphson method when the initial seed is close to the looked for solution. To determine a good initial seed the eccentric anomaly domain [0, ?] is discretized in several intervals and for each one of these intervals a fifth degree interpolating polynomial is introduced. The six coefficients of the polynomial are obtained by requiring six conditions at both ends of the corresponding interval. Thus the real function and the polynomial have equal values at both ends of the interval. Similarly relations are imposed for the two first derivatives. In the singular corner of the Kepler equation, M smaller than 1 and 1 ? e close to zero an asymptotic expansion is developed. In most of the cases, the seed generated leads to reach machine error accuracy with the modified Newton?Raphson method with no iterations or just one iteration. This approach improves the computational time compared with other methods currently in use.