On the Distance Function Between Two Keplerian Elliptic Orbits
暂无分享,去创建一个
The problem of finding critical points of the distance function between two Keplerian elliptic orbits is reduced to the determination of all real roots of a trigonometric polynomial of degree 8. The coefficients of the polynomial are rational functions of orbital parameters. Using computer algebra methods we show that a polynomial of a smaller degree with such properties does not exist. This fact shows that our result cannot be improved and it allows us to construct an optimal algorithm to find the minimal distance between two Keplerian orbits.
[1] Bruce W. Char,et al. Maple V Library Reference Manual , 1992, Springer New York.
[2] B. Buchberger,et al. Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory , 1985 .