Starting algorithms for IRK methods

DOI10.1016/S0377-0427(97)00112-XMaRDI QIDQ1372112zbMATH OpenOpenAlexFDO

Authors M. P. Laburta

Publication date 14 April 1998

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(97)00112-x

zbMATH Keywords

implicit Runge-Kutta methodsmaximum orderstarting algorithms

Mathematics Subject Classification ID

Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06)

Review text

The author presents a theoretical study about starting algorithms for the iterations of non-confluent \(s\)-stage implicit Runge-Kutta (IRK) methods. They are of three types, according to their additional computational cost per step: to consider a starting method with an additional evaluation per step, the order increases by one. First, starting algorithms without additional cost are studied. The maximum order \(s\) is determined and uniqueness of such a starting method is proved. Next, starting algorithms with one additional function evaluation per step are studied. This evaluation corresponds to the initial and to the final points of the previous step. There exists an \(s\)-parameter family of algorithms with maximum order \(s+1\). Finally, starting algorithms with two additional evaluations are considered. The existence of a three-parameter family of algorithms with maximum order \(s+2\) is proved.

Recommendations

• Starting algorithms for implicit Runge-Kutta-Nyström methods
• IRK methods for index 2 and 3 DAEs: Starting algorithms
• scientific article; zbMATH DE number 176990
• scientific article; zbMATH DE number 1744811

Cites work

• An implementation of singly-implicit Runge-Kutta methods
• Generalized symmetric Runge-Kutta methods
• scientific article; zbMATH DE number 5688205 (Why is no real title available?)
• scientific article; zbMATH DE number 702482 (Why is no real title available?)
• Iterative schemes for three-stage implicit Runge-Kutta methods
• Local error control in SDIRK-methods
• Perturbed collocation and Runge-Kutta methods
• Runge-Kutta schemes for Hamiltonian systems
• Solving ordinary differential equations. II: Stiff and differential-algebraic problems.

Cited in

(13)

• Starting algorithms for implicit Runge-Kutta-Nyström methods
• Construction of starting algorithms for the RK-Gauss methods
• Starting algorithms for Gauss Runge-Kutta methods for Hamiltonian systems.
• Performance of Gauss implicit Runge-Kutta methods on separable Hamiltonian systems.
• Variable-order starting algorithms for implicit Runge-Kutta methods on stiff problems
• Additive Runge-Kutta schemes for convection-diffusion-reaction equations
• Are high order variable step equistage initializers better than standard starting algorithms?
• IRK methods for DAE: Starting algorithms
• A time-adaptive finite volume method for the Cahn-Hilliard and Kuramoto-Sivashinsky equations
• Starting algorithms for a class of RK methods for index-2 DAEs
• Stage value predictors for additive and partitioned Runge-Kutta methods
• 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

Describes a project that uses

Uses Software

• RODAS

This page was built for publication: Starting algorithms for IRK methods

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