Algorithms for crossover point determination

DOI10.1016/S0898-1221(97)00089-8MaRDI QIDQ1368460zbMATH OpenOpenAlexFDO

Authors Bernhard Rupp, Shengping Lo, C. Kee, P. Enge

Publication date 28 September 1997

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0898-1221(97)00089-8

zbMATH Keywords

GPS satellite crossover pointiterative grid search algorithmNewton-Raphson schemesatellite orbit

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Orbital mechanics (70M20)

Review text

This paper examines three methods of determining a GPS satellite crossover point. One method is based on an iterative grid search algorithm. Two other algorithms are based on analyzing a satellite orbit and then employing a multidimensional Newton-Raphson scheme. Trial runs on each scheme enable us to determine important qualities such as memory, speed, and robustness. These qualities are important for ascertaining the best method for finding the crossover point.

Recommendations

• Algorithm for algebraic curve intersection
• Algorithms for the fixed linear crossing number problem
• The switch point algorithm
• scientific article; zbMATH DE number 1367672
• Intersection algorithms for lines and circles
• Algorithms for center and Tverberg points
• Algorithms for center and Tverberg points
• scientific article; zbMATH DE number 1984327
• An algorithm for the graph crossing number problem

Cited in

(1)

• Theory of satellite ground-track crossovers

Describes a project that uses

Uses Software

• UNCMND
• pchip

This page was built for publication: Algorithms for crossover point determination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1368460)