An algorithm is presented for efficient p-iterative solution of the Lambert/Gauss orbit-determination problem using second-order Newton iteration. The algorithm is based on a universal transformation of Kepler's time-of-flight equation and approximate inverse solutions of this equation for short-way and long-way flight paths. The approximate solutions provide both good starting values for iteration and simplified computation of the second-order term in the iteration formula. Numerical results are presented which indicate that in many cases of practical significance (except those having collinear position vectors) the algorithm produces at least eight significant digits of accuracy with just two or three steps of iteration.
Second-order p-iterative solution of the Lambert/Gauss problem
1984-12-01
Miscellaneous
No indication
English
General Transformation of Kepler's Equation for p-Iterative Solution of the Lambert-Gauss Problem
Online Contents | 1996
|Energy-Optimal Solution to the Lambert Problem
Online Contents | 2010
|Energy-Optimal Solution to the Lambert Problem
AIAA | 2010
|