Fast error-controlling MOID computation for confocal elliptic orbits
arXiv:1811.06373 · doi:10.1016/j.ascom.2019.02.005
Abstract
We present an algorithm to compute the minimum orbital intersection distance (MOID), or global minimum of the distance between the points lying on two Keplerian ellipses. This is achieved by finding all stationary points of the distance function, based on solving an algebraic polynomial equation of th degree. The algorithm tracks numerical errors appearing on the way, and treats carefully nearly degenerate cases, including practical cases with almost circular and almost coplanar orbits. Benchmarks confirm its high numeric reliability and accuracy, and that regardless of its error--controlling overheads, this algorithm pretends to be one of the fastest MOID computation methods available to date, so it may be useful in processing large catalogs.
19 pages, 4 figures, 1 table; revised version submitted to Astronomy & Computing; the computing code is available for download at http://sourceforge.net/projects/distlink/
References in corpus (1)
Cited by in corpus (4)
- Comparing the dynamics of Jupiter-family Comets and comet-like fireballs
- The 18 May 2024 Iberian superbolide from a sunskirting orbit: USG space sensors and ground-based independent observations
- A lower bound of the distance between two elliptic orbits
- Fast error-safe MOID computation involving hyperbolic orbits