Closest approach in universal variables
The authors present a formulation of the closest approach problem in universal variables. Iterative schemes are developed for the solution of the corresponding universal Kepler equation. As typical examples of the algorithm application, the authors consider Hyakutake and Hale-Bopp comets, and the minimum angular separation of ADS 9159, ADS 2959 and ADS 11632 visual binaries.
minimum angular separation of visual binaries
scientific article; zbMATH DE number 1282930