Computer Science – Numerical Analysis
Scientific paper
Aug 1978
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1978aiaa.confv....p&link_type=abstract
American Institute of Aeronautics and Astronautics and American Astronautical Society, Astrodynamics Conference, Palo Alto, Cali
Computer Science
Numerical Analysis
Iteration, Kepler Laws, Orbital Mechanics, Algorithms, Convergence, Equations Of Motion, Numerical Analysis, Transfer Orbits, Transformations
Scientific paper
Upper and lower bounds are derived for the solution to Kepler's problem for the position in a known orbit given the elapsed time from an arbitrary epoch. The bounds, expressed in both classical variables and in a universal formulation, bracket the desired solution and provide starting values for iterative numerical solutions to Kepler's problem. Geometrical interpretations of the bounds are given and their use in several iteration algorithms is discussed and illustrated by applying them to examples from the literature.
No associations
LandOfFree
Bounds on the solution to a universal 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 Bounds on the solution to a universal Kepler's equation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on the solution to a universal Kepler's equation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-942991