An improved algorithm due to laguerre for the solution of Kepler's equation

  title={An improved algorithm due to laguerre for the solution of Kepler's equation},
  author={Bruce A. Conway},
  journal={Celestial mechanics},
  • B. Conway
  • Published 1 June 1986
  • Physics
  • Celestial mechanics
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 higher-order Newton methods for the problem formulated in both conventional and universal variables and for both elliptic and hyperbolic orbits. In many thousands of trials the Laguerre method never failed to converge to the correct solution, even from exceptionally poor starting approximations. The non… 
An Improved Algorithm For The Solution of Kepler 's Equation For An Elliptical Orbit
In this paper, a root finding method due to iterative method is used first to the solution of Kepler's equation for an elliptical orbit. Then the extrapolation technique in the form of Aitken Δ 2
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
The Kepler equation for the elliptical motion, y− e siny = x, involves a nonlinear function depending on three parameters: the eccentric anomaly y ≡ E, the eccentricity e and the mean anomaly x ≡ M.
An efficient code to solve the Kepler equation. Elliptic case
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
An efficient code to solve the Kepler equation
Context. This paper introduces a new approach for solving the Kepler equation for hyperbolic orbits. We provide here the Hyperbolic Kepler Equation–Space Dynamics Group (HKE–SDG), a code to solve the
Dynamic discretization method for solving Kepler’s equation
This paper defines Kepler’s equation for the elliptical case and describes existing solution methods, and presents the dynamic discretization method and shows the results of a comparative analysis, demonstrating that, for the conditions of the tests, dynamicDiscretization performs the best.
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.
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.
On solving Kepler's equation
This work attacks Kepler's equation with 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, and finally the best and simplest starting value/solution algorithm: M + e and Wegstein's secant modification of the method of successive substitutions.
Robust resolution of Kepler’s equation in all eccentricity regimes
In this paper we discuss the resolution of Kepler’s equation in all eccentricity regimes. To avoid rounding off problems we find a suitable starting point for Newton’s method in the hyperbolic case.


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
Comparison of starting values for iterative solutions to a universal Kepler's equation
General starting values for the iterative numerical solution of a universal Kepler's equation for position in a conic orbit at a specified time are investigated. Three starting values based on recent
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
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
The solution of Kepler's equation, III
Recently proposed methods of iteration and initial guesses are discussed, including the method of Laguerre-Conway. Tactics for a more refined initial guess for use with universal variables over a
Numerical methods that work
Part I. Fundamental Methods: The calculation of functions, Roots of transcendental equations, and the care and treatment of singularities.