Dynamic discretization method for solving Kepler’s equation
| Autor: | Craig A. McLaughlin, Scott A. Feinstein |
|---|---|
| Rok vydání: | 2006 |
| Předmět: |
Elliptic orbit
Discretization Applied Mathematics Astronomy and Astrophysics Kepler's equation Kepler Celestial mechanics Variety (cybernetics) Dynamic programming Computational Mathematics symbols.namesake Space and Planetary Science Modeling and Simulation Calculus symbols Applied mathematics Mathematical Physics Mathematics |
| Zdroj: | Celestial Mechanics and Dynamical Astronomy. 96:49-62 |
| ISSN: | 1572-9478 0923-2958 |
| DOI: | 10.1007/s10569-006-9019-8 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink