Fast error-controlling MOID computation for confocal elliptic orbits

Результат исследований: Научные публикации в периодических изданияхстатья

1 цитирование (Scopus)

Выдержка

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 16th 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.

Язык оригиналаанглийский
Страницы (с-по)11-22
Число страниц12
ЖурналAstronomy and Computing
Том27
Ранняя дата в режиме онлайн27 фев 2019
DOI
СостояниеОпубликовано - апр 2019

Отпечаток

intersections
Orbits
orbits
orbitals
ellipse
ellipses
Polynomials
catalogs
polynomials
Processing
method

Предметные области Scopus

  • Астрономия и астрофизика
  • Прикладные компьютерные науки
  • Космические науки и планетоведение

Цитировать

@article{69e6cd22095d4fa29859217438f7e52a,
title = "Fast error-controlling MOID computation for confocal elliptic orbits",
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 16th 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.",
keywords = "Catalogs, Close encounters, Computational methods, Near-Earth asteroids, NEOs, DISTANCE FUNCTION, POINTS",
author = "Baluev, {R. V.} and Mikryukov, {D. V.}",
year = "2019",
month = "4",
doi = "10.1016/j.ascom.2019.02.005",
language = "English",
volume = "27",
pages = "11--22",
journal = "Astronomy and Computing",
issn = "2213-1337",
publisher = "Elsevier",

}

Fast error-controlling MOID computation for confocal elliptic orbits. / Baluev, R. V.; Mikryukov, D. V.

В: Astronomy and Computing, Том 27, 04.2019, стр. 11-22.

Результат исследований: Научные публикации в периодических изданияхстатья

TY - JOUR

T1 - Fast error-controlling MOID computation for confocal elliptic orbits

AU - Baluev, R. V.

AU - Mikryukov, D. V.

PY - 2019/4

Y1 - 2019/4

N2 - 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 16th 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.

AB - 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 16th 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.

KW - Catalogs

KW - Close encounters

KW - Computational methods

KW - Near-Earth asteroids

KW - NEOs

KW - DISTANCE FUNCTION

KW - POINTS

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

UR - http://www.mendeley.com/research/fast-errorcontrolling-moid-computation-confocal-elliptic-orbits

U2 - 10.1016/j.ascom.2019.02.005

DO - 10.1016/j.ascom.2019.02.005

M3 - Article

AN - SCOPUS:85062228842

VL - 27

SP - 11

EP - 22

JO - Astronomy and Computing

JF - Astronomy and Computing

SN - 2213-1337

ER -