Pith. Sign in

RECORD

Review of Lambert's problem

Numerical Analysis · Submitted 12 Apr 2021

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim The solvers that incorporate the best qualities are Bate's algorithm via universal variables with Newton-Raphson and Izzo's Householder algorithm.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2104.05283 (version 1)
Pith IDOSJD5ZJN, Pith's permanent record of this paper and its review
CitationDavid de la Torre Sangr\`a, Elena Fantino. "Review of Lambert's problem." arXiv:2104.05283 (2021). https://pith.science/paper/OSJD5ZJN
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 8,892 input tokens.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.12 · human participants 0.02 · controlled comparison 0.08 · randomized assignment 0.01 · states quantitative result 0.76 · compares with prior results 0.83 · mentions code or data availability 0.03.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

Lambert's problem is the orbital boundary-value problem constrained by two points and elapsed time. It is one of the most extensively studied problems in celestial mechanics and astrodynamics, and, as such, it has always attracted the interest of mathematicians and engineers. Its solution lies at the base of algorithms for, e.g., orbit determination, orbit design (mission planning), space rendezvous and interception, space debris correlation, missile and spacecraft targeting. There is abundancy of literature discussing various approaches developed over the years to solve Lambert's problem. We have collected more than 70 papers and, of course, the issue is treated in most astrodynamics and celestial mechanics textbooks. From our analysis of the documents, we have been able to identify six or seven main solution methods, each associated to a number of revisions and variations, and many, so to say, secondary research lines with little or no posterior development. We have ascertained plenty of literature with proposed solutions, in many cases supplemented by performance comparisons with other methods. We have reviewed and organized the existing bibliography on Lambert's problem and we have performed a quantitative comparison among the existing methods for its solution. The analysis is based on the following issues: choice of the free parameter, number of iterations, generality of the mathematical formulation, limits of applicability (degeneracies, domain of the parameter, special cases and peculiarities), accuracy, and suitability to automatic execution. Eventually we have tested the performance of each code. The solvers that incorporate the best qualities are Bate's algorithm via universal variables with Newton-Raphson and Izzo's Householder algorithm. The former is the fastest, the latter exhibits the best ratio between speed, robustness and accuracy.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Lambert's problem is the orbital boundary-value problem constrained by two points and elapsed time. background 1.00 0.04 0.02 asserted 1.00
s1 It is one of the most extensively studied problems in celestial mechanics and astrodynamics, and, as such, it has always attracted the interest of mathematicians and engineers. background 1.00 0.04 0.01 asserted 1.00
s2 Its solution lies at the base of algorithms for, e.g., orbit determination, orbit design (mission planning), space rendezvous and interception, space debris correlation, missile and spacecraft targeting. background 1.00 0.05 0.02 asserted 1.00
s3 There is abundancy of literature discussing various approaches developed over the years to solve Lambert's problem. background 1.00 0.04 0.02 asserted 1.00
s4 We have collected more than 70 papers and, of course, the issue is treated in most astrodynamics and celestial mechanics textbooks. background 0.56 0.82 0.02 asserted 1.00
s5 From our analysis of the documents, we have been able to identify six or seven main solution methods, each associated to a number of revisions and variations, and many, so to say, secondary research lines with little or no posterior development. contribution 0.42 0.90 0.05 asserted 0.98
s6 We have ascertained plenty of literature with proposed solutions, in many cases supplemented by performance comparisons with other methods. background 0.88 0.42 0.02 asserted 1.00
s7 We have reviewed and organized the existing bibliography on Lambert's problem and we have performed a quantitative comparison among the existing methods for its solution. contribution 0.97 0.96 0.07 asserted 1.00
s8 The analysis is based on the following issues: choice of the free parameter, number of iterations, generality of the mathematical formulation, limits of applicability (degeneracies, domain of the parameter, special cases and peculiarities), accuracy, and suitability to automatic execution. method 0.95 0.39 0.03 asserted 0.95
s9 Eventually we have tested the performance of each code. method 0.85 0.94 0.03 asserted 1.00
s10 The solvers that incorporate the best qualities are Bate's algorithm via universal variables with Newton-Raphson and Izzo's Householder algorithm. result 1.00 0.85 0.78 asserted 1.00
s11 The former is the fastest, the latter exhibits the best ratio between speed, robustness and accuracy. result 0.92 0.87 0.48 asserted 1.00

What kind of paper the classifier reports this is: review 1.00 · evidence from literature 0.86.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Lambert's problem is the orbital boundary-value problem constrained by two points and elapsed time. It is one of the most extensively studied problems in celestial mechanics and astrodynamics, and, as such, it has always attracted the interest of mathematicians and engineers. Its solution lies at the base of algorithms for, e.g., orbit determination, orbit design (mission planning), space rendezvous and interception, space debris correlation, missile and spacecraft targeting. There is abundancy of literature discussing various approaches developed over the years to solve Lambert's problem. We have collected more than 70 papers and, of course, the issue is treated in most astrodynamics and celestial mechanics textbooks. From our analysis of the documents, we have been able to identify six or seven main solution methods, each associated to a number of revisions and variations, and many, so to say, secondary research lines with little or no posterior development. We have ascertained plenty of literature with proposed solutions, in many cases supplemented by performance comparisons with other methods. We have reviewed and organized the existing bibliography on Lambert's problem and we have performed a quantitative comparison among the existing methods for its solution. The analysis is based on the following issues: choice of the free parameter, number of iterations, generality of the mathematical formulation, limits of applicability (degeneracies, domain of the parameter, special cases and peculiarities), accuracy, and suitability to automatic execution. Eventually we have tested the performance of each code. The solvers that incorporate the best qualities are Bate's algorithm via universal variables with Newton-Raphson and Izzo's Householder algorithm. The former is the fastest, the latter exhibits the best ratio between speed, robustness and accuracy.

Human review
References
How the literature uses it

1 arXiv paper cite this in 1 sentence

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.