论文信息 - An Algebraic Method to Compute the Critical Points of the Distance Function Between Two Keplerian Orbits

An Algebraic Method to Compute the Critical Points of the Distance Function Between Two Keplerian Orbits

We describe an efficient algorithm to compute all the critical points of the distance function between two Keplerian orbits (either bounded or unbounded) with a common focus. The critical values of this function are important for different purposes, for example to evaluate the risk of collisions of asteroids or comets with the Solar system planets. Our algorithm is based on the algebraic elimination theory: through the computation of the resultant of two bivariate polynomials, we find a 16th degree univariate polynomial whose real roots give us one component of the critical points. We discuss also some degenerate cases and show several examples, involving the orbits of the known asteroids and comets.

Giovanni F. Gronchi | G. Gronchi

[1] P. Dybczyński,et al. On the minimum distance between two Keplerian orbits with a common focus , 1986 .

[2] Konstantin V. Kholshevnikov,et al. On the Distance Function Between Two Keplerian Elliptic Orbits , 1999 .

[3] Dario Bini,et al. Numerical computation of polynomial zeros by means of Aberth's method , 1996, Numerical Algorithms.

[4] Distance Between Two Arbitrary Unperturbed Orbits , 2005 .

[5] D. N. Bernshtein. The number of roots of a system of equations , 1975 .

[6] Linda L. Crawford,et al. An analytic method to determine future close approaches between satellites , 1984 .

[7] David A. Cox,et al. Ideals, Varieties, and Algorithms , 1997 .

[8] Giovanni F. Gronchi. On the Stationary Points of the Squared Distance between Two Ellipses with a Common Focus , 2002, SIAM J. Sci. Comput..

[9] Luigi Accardi. The noncommutative Markovian property , 1975 .