Construction of starting algorithms for the RK-Gauss methods

DOI10.1016/S0377-0427(98)00003-XMaRDI QIDQ1298497zbMATH OpenOpenAlexFDO

Authors M. P. Laburta

Publication date 25 April 2000

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-0427(98)00003-x

zbMATH Keywords

(RK)Hamiltonian systemsnumerical experimentsperformanceRunge-Kutta methodsstarting algorithmssymplectic methods

Mathematics Subject Classification ID

Discretization methods and integrators (symplectic, variational, geometric, etc.) for dynamical systems (37M15) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Numerical methods for Hamiltonian systems including symplectic integrators (65P10)

Review text

Physical systems are often described by a set of Hamilton equations which is of the form \[ y'= F(y),\quad y(t_0)= y_0\in\mathbb{R}^D, \] Runge-Kutta (RK) methods are applied to numerically solve such systems, especially the so-called symplectic methods are very advantageous. RK methods based on Gauss-Legendre quadrature represent a category of such symplectic methods. These however are implicit and need some starting algorithms. The author gives some starting algorithms with 2, 3 and 4 stages. Numerical experiments with Hamiltonian systems are presented to show the performance of these algorithms of high order.

Recommendations

• Starting algorithms for Gauss Runge-Kutta methods for Hamiltonian systems.
• Starting algorithms for the iterations of the RKN-Gauss methods
• Two-step high order starting values for implicit Runge--Kutta methods
• Initializers for RK-Gauss methods based on pseudo-symplecticity
• Gauss-Runge-Kutta-Nyström methods

Cites work

• An analysis of the order of Runge-Kutta methods that use an iterative scheme to compute their internal stage values
• Canonical Runge-Kutta-Nyström methods of orders five and six
• Explicit Canonical Methods for Hamiltonian Systems
• High-Order Symplectic Runge–Kutta–Nyström Methods
• scientific article; zbMATH DE number 5688205 (Why is no real title available?)
• scientific article; zbMATH DE number 177016 (Why is no real title available?)
• scientific article; zbMATH DE number 556480 (Why is no real title available?)
• scientific article; zbMATH DE number 702482 (Why is no real title available?)
• scientific article; zbMATH DE number 775671 (Why is no real title available?)
• Numerical quadrature and solution of ordinary differential equations. A textbook for a beginning course in numerical analysis
• Runge-Kutta schemes for Hamiltonian systems
• Solving ordinary differential equations. II: Stiff and differential-algebraic problems.
• Starting algorithms for IRK methods
• The use of Butcher series in the analysis of Newton-like iterations in Runge-Kutta formulas

Cited in

(9)

• Starting algorithms for implicit Runge-Kutta-Nyström methods
• Starting algorithms for Gauss Runge-Kutta methods for Hamiltonian systems.
• Performance of Gauss implicit Runge-Kutta methods on separable Hamiltonian systems.
• Starting algorithms for the iterations of the RKN-Gauss methods
• Are high order variable step equistage initializers better than standard starting algorithms?
• A technique to construct symmetric variable-stepsize linear multistep methods for second-order systems
• Analysis of starting approximations for implicit Runge-Kutta methods applied to ODEs based on the reverse method
• Initializers for RK-Gauss methods based on pseudo-symplecticity
• Numerical implementation of complex orthogonalization, parallel transport on Stiefel bundles, and analyticity

Describes a project that uses

Uses Software

• RODAS

This page was built for publication: Construction of starting algorithms for the RK-Gauss methods

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