论文信息 - Reducing round-off errors in symmetric multistep methods

Reducing round-off errors in symmetric multistep methods

Certain symmetric linear multistep methods have an excellent long-time behavior when applied to second order Hamiltonian systems with or without constraints. For high accuracy computations round-off can be the dominating source of errors. This article shows how symmetric multistep methods should be implemented such that round-off errors are minimized and propagate like a random walk.

Ernst Hairer | Paola Console | E. Hairer | Paola Console

[1] P. Henrici. Discrete Variable Methods in Ordinary Differential Equations , 1962 .

[2] Ernst Hairer,et al. Symmetric multistep methods for constrained Hamiltonian systems , 2013, Numerische Mathematik.

[3] E. Hairer,et al. Geometric Numerical Integration , 2022, Oberwolfach Reports.

[4] F. Krogh,et al. Solving Ordinary Differential Equations , 2019, Programming for Computations - Python.

[5] E. Hairer,et al. Solving Ordinary Differential Equations II , 2010 .

[6] V. Kozlov,et al. Kepler's problem in constant curvature spaces , 1992 .

[7] Ernst Hairer,et al. Achieving Brouwer’s law with implicit Runge–Kutta methods , 2008 .

[8] S. Tremaine,et al. Symmetric Multistep Methods for the Numerical Integration of Planetary Orbits , 1990 .

[9] E. Hairer,et al. Geometric Numerical Integration: Structure Preserving Algorithms for Ordinary Differential Equations , 2004 .

[10] H. C. Andersen. Rattle: A “velocity” version of the shake algorithm for molecular dynamics calculations , 1983 .

[11] Ernst Hairer,et al. Symmetric multistep methods over long times , 2004, Numerische Mathematik.

[12] Ernst Hairer,et al. Solving Ordinary Differential Equations I: Nonstiff Problems , 2009 .