New Runge-Kutta algorithms for numerical simulation in dynamical astronomy

@article{Dormand1978NewRA,
  title={New Runge-Kutta algorithms for numerical simulation in dynamical astronomy},
  author={J. R. Dormand and P. J. Prince},
  journal={Celestial mechanics},
  year={1978},
  volume={18},
  pages={223-232}
}
Some new Runge-Kutta and Runge-Kutta-Nystrom algorithms are presented for the solution of ordinary differential equations of the initial value type. The methods are compared with others in integrating the equations of motion of the two body problem and are shown to offer advantages in efficiency. It is also demonstrated that the new methods can be ‘tuned’ to achieve some measure of global error control. 
Behaviour of a new type of Runge–Kutta methods when integrating satellite orbits
Recently, González, Martín and Farto have developed new numerical methods (RKGM methods) of Runge–Kutta type and fixed step size for the numerical integration of perturbed oscillators. Moreover, it
Algorithm 670: a Runge-Kutta-Nyström code
TLDR
A robust, reliable, and efficient code implementing recently developed Runge-Kutta-Nystrom formulas is described, based on a modular approach to the design of software for the numerical solution of ordinary differential equations.
Numerical integration of the equations of motion of celestial mechanics
Recently a number of new techniques have been developed for the numerical solution of the differential equations governing the motion of bodies in the Solar System, moving under their mutual
Discovering New Runge-Kutta Methods Using Unstructured Numerical Search
TLDR
This paper presents the first known 10th-order Runge-Kutta method with only 16 stages, breaking a 40-year standing record for the number of stages required to achieve 10 fourth-order accuracy.
Efficient Numerical Integration for Gravitational N-Body Simulations
TLDR
The implementation of the Gauss Implicit Runge–Kutta methods in an efficient way such that the error growth satisfies Brouwer’s Law is implemented and numerical experiments show that using the new way of implementation reduces the integration cost up to 20%.
Continuous extensions to Nyström methods for second order initial value problems
In this work we consider interpolants for Nyström methods, i.e., methods for solving second order initial value problems. We give a short introduction to the theory behind the discrete methods, and
Behaviour of the SMF method for the numerical integration of satellite orbits
The SMF algorithms were recently developed by the authors as a multistep generalization of the ScheifeleG-functions one-step method. Like the last, the proposed codes integrate harmonic oscillations
Initial-Value Problems for ODE
TLDR
This chapter deals with methods of advancing the given initial state of a system to later times, explaining clearly the role of stiffness, local discretization and round-off errors, and introducing the crucial concepts of consistency, convergence, and stability of difference schemes by which the differential equations are approximated.
...
...

References

SHOWING 1-8 OF 8 REFERENCES
A Runge-Kutta Nyström algorithm
A Runge-Kutta algorithm of order five is presented for the solution of the initial value problem where the system of ordinary differential equations is of second order and does not contain the first
On Runge-Kutta processes of high order
An (explicit) Runge-Kutta process is a means of numerically solving the differential equation , at the point x = x0+h, where y, f may be vectors.
Treatment of Close Approaches in the Numerical Integration of the Gravitational Problem of N-Bodies (Papers appear in the Proceedings of IAU Colloquium No. 10 Gravitational N-Body Problem (ed. by Myron Lecar), R. Reidel Publ. Co. , Dordrecht-Holland.)
One of the main difficulties encountered in the numerical integration of the gravitationaln-body problem is associated with close approaches. The singularities of the differential equations of motion
Local Estimation of the Global Discretization Error
TLDR
It is shown that there exist both RK-methods and multistep methods, the error equation of which is exact, and the lowest order term of the global discretization error of the numerical solution to a system of ordinary differential equations satisfies this equation.
Comparing Numerical Methods for Ordinary Differential Equations
TLDR
According to criteria involving the number of function evaluations, overhead cost, and reliability, the best general-purpose method, if function evaluations are not very costly, is one due to Bulirsch and Stoer, however, when function evaluated methods are relatively expensive, variable-order methods based on Adams formulas are best.
Automatic numerical integration