Computer Science
Scientific paper
Oct 1979
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1979cemec..20..243n&link_type=abstract
Celestial Mechanics, vol. 20, Oct. 1979, p. 243-249.
Computer Science
10
Algorithms, Elliptical Orbits, Kepler Laws, Orbital Mechanics, Anomalies, Eccentricity, Iterative Solution, Newton-Raphson Method, Univac 1108 Computer
Scientific paper
An efficient algorithm is presented for the solution of Kepler's equation f(E)=E-M-e sin E=0, where e is the eccentricity, M the mean anomaly and E the eccentric anomaly. This algorithm is based on simple initial approximations that are cubics in M, and an iterative scheme that is a slight generalization of the Newton-Raphson method. Extensive testing of this algorithm has been performed on the UNIVAC 1108 computer. Solutions for 20,000 pairs of values of e and M show that for single precision, 42.0% of the cases require one iteration, 57.8% two and 0.2% three. For double precision one additional iteration is required.
No associations
LandOfFree
A general algorithm for the solution of Kepler's equation for elliptic orbits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A general algorithm for the solution of Kepler's equation for elliptic orbits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A general algorithm for the solution of Kepler's equation for elliptic orbits will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1387751