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

performancenumerical experimentsHamiltonian systemssymplectic methodsRunge-Kutta methodsstarting algorithms(RK)

Mathematics Subject Classification ID

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

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

• 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?)
• 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
• 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

(7)

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

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)