CORDIC-like method for solving Kepler’s equation

  title={CORDIC-like method for solving Kepler’s equation},
  author={Mathias Zechmeister},
  journal={Astronomy \& Astrophysics},
  • M. Zechmeister
  • Published 1 November 2018
  • Computer Science, Physics
  • Astronomy & Astrophysics
Context. Many algorithms to solve Kepler’s equations require the evaluation of trigonometric or root functions. Aims. We present an algorithm to compute the eccentric anomaly and even its cosine and sine terms without usage of other transcendental functions at run-time. With slight modifications it is also applicable for the hyperbolic case. Methods. Based on the idea of CORDIC, our method requires only additions and multiplications and a short table. The table is independent of eccentricity… 
Solving Kepler's equation via nonlinear sequence transformations
Since more than three centuries Kepler’s equation continues to represents an important benchmark for testing new computational techniques. In the present paper, the classical Kapteyn series solution
Bivariate Infinite Series Solution of Kepler’s Equations
A class of bivariate infinite series solutions of the elliptic and hyperbolic Kepler equations is described, adding to the handful of 1-D series that have been found throughout the centuries. This
Comment on ‘An efficient code to solve the Kepler equation: elliptic case’
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 modified Newton–Raphson
Solving Kepler’s equation with CORDIC double iterations
The new shift-and-add algorithm brings Kepler's equation close to hardware and allows to solve it with cheap and simple hardware components.


A method solving kepler's equation without transcendental function evaluations
We developed two approximations of the Newton-Raphson method. The one is a sort of discretization, namely to search an approximate solution on pre-specified grid points. The other is a Taylor series
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.
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.
Fast Procedure Solving Universal Kepler's Equation
We developed a procedure to solve a modification of the standard form of the universal Kepler’s equation, which is expressed as a nondimensional equation with respect to a nondimensional variable.
Symplectic maps for the N-body problem.
The present study generalizes the mapping method of Wisdom (1982) to encompass all gravitational n-body problems with a dominant central mass. The rationale for the generalized mapping method is
The CORDIC Trigonometric Computing Technique
The trigonometric algorithms used in this computer and the instrumentation of these algorithms are discussed in this paper.
Virtually Scaling-Free Adaptive CORDIC Rotator
A novel CORDIC rotator algorithm that adaptively selects appropriate iteration steps and converges to the final result by executing 50% less number of iterations on an average compared to that required for the classical CORDic.
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