Kaula's classic recursion formulas are far faster than newer recursive methods and brute-force symbolic algebra for constructing the averaged gravitational potential that controls long-term satellite motion.
Delaunay variables approach to the elimination of the perigee
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Analytical integration in Artificial Satellite Theory may benefit from different canonical simplification techniques, like the elimination of the parallax, the relegation of the nodes, or the elimination of the perigee. These techniques were originally devised in polar-nodal variables, an approach that requires expressing the geopotential as a Pfaffian function in certain invariants of the Kepler problem. However, it has been recently shown that such sophisticated mathematics are not needed if implementing both the relegation of the nodes and the parallax elimination directly in Delaunay variables. Proceeding analogously, it is shown here how the elimination of the perigee can be carried out also in Delaunay variables. In this way the construction of the simplification algorithm becomes elementary, on one hand, and the computation of the transformation series is achieved with considerable savings, on the other, reducing the total number of terms of the elimination of the perigee to about one third of the number of terms required in the classical approach.
fields
math.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Exploring the long-term dynamics of perturbed Keplerian motion in high degree potential fields
Kaula's classic recursion formulas are far faster than newer recursive methods and brute-force symbolic algebra for constructing the averaged gravitational potential that controls long-term satellite motion.