The Convergence of Newton–Raphson Iteration with Kepler's Equation

  title={The Convergence of Newton–Raphson Iteration with Kepler's Equation},
  author={E. D. Charles and Jeremy B. Tatum},
  journal={Celestial Mechanics and Dynamical Astronomy},
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 apparently capricious and random values of the eccentricity and mean anomaly for which convergence seems not to be easily reached when the starting guess for the eccentric anomaly is taken to be equal to the mean anomaly. We examine this chaotic behavior and show that rapid convergence is always reached… 
Chaotic behaviour in the newton iterative function associated with kepler's equation
The chaotic behaviour observed when Newton's method is used to solve Kepler's equation is analysed using methods borrowed from chaos theory. The result of the analysis is compared with previous
An analysis of the convergence of Newton iterations for solving elliptic Kepler’s equation
In this note a study of the convergence properties of some starters $$ E_0 = E_0(e,M)$$E0=E0(e,M) in the eccentricity–mean anomaly variables for solving the elliptic Kepler’s equation (KE) by
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 dynamics of Kepler equation
It is well known that Kepler?s equation can be solved by means of an iterative method defined, in a natural way, from the equation itself. This method yields to the unique solution if the
Métodos iterativos aplicados a la ecuación de Kepler
In this thesis we join two exciting areas such as astronomy, consisting of Kepler's equation, and numerical analysis, represented by iterative methods of solving equations. We investigate the
Rootfinding for a transcendental equation without a first guess: polynomialization of Kepler's equation through Chebyshev polynomial expansion of the sine
The Kepler equation for the parameters of an elliptical orbit, E-e sin(E) = M, is reduced from a transcendental to a polynomial equation by expanding the sine as a series of Chebyshev polynomials.
Global convergence of Newton’s method on an interval
Global convergence of the method is considered in the strong sense of convergence for any initial value in I and any feasible right-hand side and the class of functions for which the method converges globally is characterized.
Fast switch and spline scheme for accurate inversion of nonlinear functions: The new first choice solution to Kepler's equation
An alternative scheme, based on switching variables followed by spline interpolation, which can be applied to monotonic functions under very general conditions, which outperforms Newton’s method for all values of the number of points N ≥ 2.
Solving Non-linear Equations
This chapter ends with a discussion on how to solve algebraic equations of several variables (frequently occurring in automated assembly of mechanical systems, robot control, coding and cryptography), for which powerful algorithms based on Grobner bases have been developed.
Chebyshev expansion on intervals with branch points with application to the root of Kepler's equation: A Chebyshev-Hermite-Padé method
When two or more branches of a function merge, the Chebyshev series of u(@l) will converge very poorly with coefficients a"n of T"n(@l) falling as O(1/n^@a) for some small positive exponent @a.


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
On solving Kepler's equation
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
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
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
The hyperbolic Kepler equation (and the elliptic equation revisited)
A procedure is developed that, in two iterations, solves the hyperbolic Kepler's equation in a very efficient manner, and to an accuracy that proves to be always better than 10−20 (relative
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
The solution of Kepler's equation, II
Starting values for the iterative solution of Kepler's equation are considered for hyperbolic orbits, and for generalized versions of the equation, including the use of universal variables.
Text-Book on Spherical Astronomy
1. Spherical trigonometry 2. The celestial sphere 3. Refraction 4. The meridian circle 5. Planetary motions 6. Time 7. Planetary phenomena and heliographic co-ordinates 8. Aberration 9. Parallax 10.
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