Testing of Adaptive Symplectic Conservative Numerical Methods for Solving the Kepler Problem


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

The properties of a family of new adaptive symplectic conservative numerical methods for solving the Kepler problem are examined. It is shown that the methods preserve all first integrals of the problem and the orbit of motion to high accuracy in real arithmetic. The time dependences of the phase variables have the second, fourth, or sixth order of accuracy. The order depends on the chosen values of the free parameters of the family. The step size in the methods is calculated automatically depending on the properties of the solution. The methods are effective as applied to the computation of elongated orbits with an eccentricity close to unity.

About the authors

G. G. Elenin

Faculty of Computational Mathematics and Cybernetics, Moscow State University; Scientific Research Institute for System Analysis, Federal Research Center,
Russian Academy of Sciences

Author for correspondence.
Email: elenin2@rambler.ru
Russian Federation, Moscow, 119991; Moscow, 117218

T. G. Elenina

Faculty of Physics, Moscow State University

Author for correspondence.
Email: t.yelenina@gmail.com
Russian Federation, Moscow, 119991

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2018 Pleiades Publishing, Ltd.