On solving Kepler's equation

  title={On solving Kepler's equation},
  author={Laurence G. Taff and Timothy A Brennan},
  journal={Celestial Mechanics and Dynamical Astronomy},
  • L. Taff, T. Brennan
  • Published 1 June 1989
  • Physics, Geology, Computer Science
  • Celestial Mechanics and Dynamical Astronomy
Intrigued by the recent advances in research on solving Kepler's equation, we have attacked the problem too. Our contributions emphasize the unified derivation of all known bounds and several starting values, a proof of the optimality of these bounds, a very thorough numerical exploration of a large variety of starting values and solution techniques in both mean anomaly/eccentricity space and eccentric anomaly/eccentricity space, and finally the best and simplest starting value/solution… 
On solving Kepler's equation for nearly parabolic orbits
We deal here with the efficient starting points for Kepler's equation in the special case of nearly parabolic orbits. Our approach provides with very simple formulas that allow calculating these
Appropriate Starter for Solving the Kepler's Equation
This article focuses on the methods that have been used for solving the Kepler’s equation for thirty years, then Kepler's equation will be solved by Newton-Raphson's method, and one appropriate choice first guesses that increase the isotropy and decrease the time of Implementation of solving is introduced.
The solution of the generalized Kepler's equation
In the context of general perturbation theories, the main problem of the artificial satellite analyses the motion of an orbiter around an Earth-like planet, only perturbed by its equatorial bulge or
The Convergence of Newton–Raphson Iteration with Kepler's Equation
Conway (Celest. Mech. 39, 199–211, 1986) drew attention to the circumstance that when the Newton–Raphson algorithm is applied to Kepler's equation for very high eccentricities there are certain
Sequential solution to Kepler’s equation
Seven sequential starter values for solving Kepler’s equation are proposed for fast orbit propagation and obtain improved accuracy at lower computational cost as compared to the best existing methods.
In this paper we find bounds on the solution to Kepler's equation for hyperbolic and parabolic motions. Two general concepts introduced here may be proved useful in similar numerical problems.
Solving Kepler's equation with high efficiency and accuracy
We present a method for solving Kepler's equation for elliptical orbits that represents a gain in efficiency and accuracy compared with those currently in use. The gain is obtained through a starter
Optimal starters for solving the elliptic Kepler’s equation
The highly accurate starter given by Markley is considered in proposing an improvement of it for low to medium eccentricities and new optimal starters with respect to these measures are derived.
Kepler Equation solver
Kepler's Equation is solved over the entire range of elliptic motion by a fifth-order refinement of the solution of a cubic equation, and requires only four transcendental function evaluations.
Numerical solution of the two-body problem for orbital motion is heavily dependent on efficient solution of Kepler's Equation
Kepler's Equation is solved over the entire range of elliptic motion by a fifth-order refinement of the solution of a cubic equation. This method is not iterative, and requires only four


A general algorithm for the solution of Kepler's equation for elliptic orbits
An efficient algorithm is presented for the solution of Kepler's equationf(E)=E−M−e sinE=0, wheree is the eccentricity,M the mean anomaly andE the eccentric anomaly. This algorithm is based on simple
An improved algorithm due to laguerre for the solution of Kepler's equation
A root-finding method due to Laguerre (1834–1886) is applied to the solution of the Kepler problem. The speed of convergence of this method is compared with that of Newton's method and several
The solution of Kepler's equation, I
Methods of iteration are discussed in relation to Kepler's equation, and various initial ‘guesses’ are considered, with possible strategies for choosing them. Several of these are compared; the
A simple, efficient starting value for the iterative solution of Kepler's equation
A simple starting value for the iterative solution of Kepler's equation in the elliptic case is presented. This value is then compared against five other starting values for 3750 test cases. In
Bounds on the solution to Kepler's equation
For Kepler's equation two general linear methods of the bounds determination forE0 root are presented. The methods based on elementary properties of convex functions allow an approach toE0 root
An Algorithm with Guaranteed Convergence for Finding a Zero of a Function
An algorithm is presented for finding a zero of a function which changes sign in a given interval using linear interpolation and inverse quadratic interpolation with bisection and ALGOL 60 procedures.
Analysis of Numerical Methods
Keywords: analyse ; methodes : numeriques ; equations : lineaires ; calcul : integral ; equations : differentielles Reference Record created on 2005-11-18, modified on 2016-08-08