Papers › Revisiting Lambert's Problem
Revisiting Lambert's Problem
Dario Izzo
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The orbital boundary value problem, also known as Lambert Problem, is revisited. Building upon Lancaster and Blanchard approach, new relations are revealed and a new variable representing all problem classes, under L-similarity, is used to express the time of flight equation. In the new variable, the time of flight curves have two oblique asymptotes and they mostly appear to be conveniently approximated by piecewise continuous lines. We use and invert such a simple approximation to provide an efficient initial guess to an Householder iterative method that is then able to converge, for the single revoltuion case, in only two iterations. The resulting algorithm is compared to Gooding's procedure revealing to be numerically as accurate, while having a smaller computational complexity.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections