Distance Between Two Arbitrary Unperturbed Orbits

Astronomy and Astrophysics – Astronomy

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5

Critical Points, Distance Function, Elliptic, Parabolic, Hyperbolic And Rectilinear Orbits

Scientific paper

In the paper by Kholshevnikov and Vassilie, 1999, (see also references therein) the problem of finding critical points of the distance function between two confocal Keplerian elliptic orbits (hence finding the distance between them in the sense of set theory) is reduced to the determination of all real roots of a trigonometric polynomial of degree eight. In non-degenerate cases a polynomial of lower degree with such properties does not exist. Here we extend the results to all possible cases of ordered pairs of orbits in the Two Body Problem. There are nine main cases corresponding to three main types of orbits: ellipse, hyperbola, and parabola. Note that the ellipse hyperbola and hyperbola ellipse cases are not equivalent as we exclude the variable marking the position on the second curve. For our purposes rectilinear trajectories can be treated as particular (not limiting) cases of elliptic or hyperbolic orbits.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Distance Between Two Arbitrary Unperturbed Orbits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distance Between Two Arbitrary Unperturbed Orbits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distance Between Two Arbitrary Unperturbed Orbits will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-1214583

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.