Revisiting the computation of the critical points of the Keplerian distance

DOI10.1007/s10569-023-10161-4zbMath1529.70010arXiv2305.13900MaRDI QIDQ6076466

Giulio Baù, Giovanni Federico Gronchi, Clara Grassi

Publication date: 17 October 2023

Published in: Celestial Mechanics and Dynamical Astronomy (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2305.13900

zbMATH Keywords

optimal boundelliptic orbitnear-Earth asteroidbounded trajectoryeccentric/true anomalyminimum orbital intersection distance

Mathematics Subject Classification ID

Computational methods for problems pertaining to mechanics of particles and systems (70-08) Two-body problems (70F05) Celestial mechanics (70F15) Orbital mechanics (70M20)

Cites Work

• Unnamed Item
• Numerical computation of polynomial zeros by means of Aberth's method
• Distance between two arbitrary unperturbed orbits
• An algebraic method to compute the critical points of the distance function between two Keplerian orbits
• On the distance function between two Keplerian elliptic orbits
• On the nodal distance between two Keplerian trajectories with a common focus
• On the uncertainty of the minimal distance between two confocal Keplerian orbits
• Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?
• THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX
• On the minimum distance between two Keplerian orbits with a common focus
• On the Stationary Points of the Squared Distance between Two Ellipses with a Common Focus
• Rank-Structured QR for Chebyshev Rootfinding

This page was built for publication: Revisiting the computation of the critical points of the Keplerian distance