Astronomy and Astrophysics – Astronomy
Scientific paper
Sep 2006
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2006cemda..96...49f&link_type=abstract
Celestial Mechanics and Dynamical Astronomy, Volume 96, Issue 1, pp.49-62
Astronomy and Astrophysics
Astronomy
4
Kepler&Rsquo, S Equation, Elliptical Motion, Dynamic Programming
Scientific paper
Kepler’s equation needs to be solved many times for a variety of problems in Celestial Mechanics. Therefore, computing the solution to Kepler’s equation in an efficient manner is of great importance to that community. There are some historical and many modern methods that address this problem. Of the methods known to the authors, Fukushima’s discretization technique performs the best. By taking more of a system approach and combining the use of discretization with the standard computer science technique known as dynamic programming, we were able to achieve even better performance than Fukushima. We begin by defining Kepler’s equation for the elliptical case and describe existing solution methods. We then present our dynamic discretization method and show the results of a comparative analysis. This analysis will demonstrate that, for the conditions of our tests, dynamic discretization performs the best.
Feinstein Scott A.
McLaughlin Craig A.
No associations
LandOfFree
Dynamic discretization method for solving Kepler's equation 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 Dynamic discretization method for solving Kepler's equation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic discretization method for solving Kepler's equation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-997961