Abstract

Abstract In this paper, constrained minimization for the point of closest approach of two conic sections is developed. For this development, we considered the nine cases of possible conics, namely, (elliptic–elliptic), (elliptic–parabolic), (elliptic–hyperbolic), (parabolic–elliptic), (parabolic–parabolic), (parabolic–hyperbolic), (hyperbolic–elliptic), (hyperbolic–parabolic), and (hyperbolic–hyperbolic). The developments are considered from two points of view, namely, analytical and computational. For the analytical developments, the literal expression of the minimum distance equation (S) and the constraint equation (G), including the first and second derivatives for each case, are established. For the computational developments, we construct an efficient algorithm for calculating the minimum distance by using the Lagrange multiplier method under the constraint on time. Finally, we compute the closest distance S between two conics for some orbits. The accuracy of the solutions was checked under the conditions that L| solution ≤ ɛ1; G| solution ≤ ɛ2, where ɛ1,2 < 10−10. For the cases of (parabolic–parabolic), (parabolic–hyperbolic), and (hyperbolic–hyperbolic), we studied thousands of comets, but the condition of the closest approach was not met.

Highlights

  • The problem of determining the point of closest approach of two orbits has important applications

  • The close approach analysis can be applied on the orbital elements and for geometrical analysis of the orbital elements

  • The numerical methods are based on the orbital ephemeris of objects either at certain time steps during a certain interval or the position and velocity information obtained from the orbital model

Read more

Summary

INTRODUCTION

The problem of determining the point of closest approach of two orbits has important applications. The close approach analysis can be applied on the orbital elements and for geometrical analysis of the orbital elements In these cases, the information of the closest approach events could be obtained by applying the differential method. The numerical methods are based on the orbital ephemeris of objects either at certain time steps during a certain interval or the position and velocity information obtained from the orbital model. The relative position and closest approach information are obtained by numerical processing methods, such as difference, interpolation, fitting, and polynomial root-finding to the orbital ephemerides or positions. The method is valid for all values of eccentricities

The plane coordinates
Transformation to the fundamental plane
Distance and constraint functions
PROBLEM FORMULATION
The sufficient condition for the closest approach
He ssian matrix de rivative s
RESULTS AND DISCUSSION
CONCLUSIONS
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.