TY - JOUR

T1 - Fast error-safe MOID computation involving hyperbolic orbits

AU - Baluev, R.V.

N1 - Funding Information: This work was supported by the Russian Science Foundation Grant No. 18-12-00050 . We express gratitude to Dr. G.F. Gronchi for reviewing this manuscript and providing useful comments.

PY - 2021/1

Y1 - 2021/1

N2 - We extend our previous algorithm computing the minimum orbital intersection distance (MOID) to include hyperbolic orbits, and mixed combinations ellipse–hyperbola. The MOID is computed by finding all stationary points of the distance function, equivalent to finding all the roots of an algebraic polynomial equation of 16th degree. The updated algorithm carries about numerical errors as well, and benchmarks confirmed its numeric reliability together with high computing performance.

AB - We extend our previous algorithm computing the minimum orbital intersection distance (MOID) to include hyperbolic orbits, and mixed combinations ellipse–hyperbola. The MOID is computed by finding all stationary points of the distance function, equivalent to finding all the roots of an algebraic polynomial equation of 16th degree. The updated algorithm carries about numerical errors as well, and benchmarks confirmed its numeric reliability together with high computing performance.

KW - Catalogs

KW - Close encounters

KW - Computational methods

KW - NEOs

UR - http://www.scopus.com/inward/record.url?scp=85097719594&partnerID=8YFLogxK

UR - http://arxiv.org/abs/2011.12148

UR - https://www.mendeley.com/catalogue/3bc950c4-cc0d-3507-bd11-2e843be63cbf/

U2 - 10.1016/j.ascom.2020.100440

DO - 10.1016/j.ascom.2020.100440

M3 - Article

VL - 34

JO - Astronomy and Computing

JF - Astronomy and Computing

SN - 2213-1337

M1 - 100440

ER -