On the starting algorithms for fully implicit Runge-Kutta methods

DOI10.1023/A:1022340401909zbMath0970.65081OpenAlexW60958843MaRDI QIDQ1592693

S. González-Pinto, S. Pérez-Rodríguez, Juan I. Montijano

Publication date: 25 January 2001

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022340401909

zbMATH Keywords

numerical experimentsVan der Pol equationstiff initial value problemsfully implicit Runge-Kutta methodsstarting algorithmsOregonator modelssolutions of stage equations

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)

Related Items (8)

Are high order variable step equistage initializers better than standard starting algorithms? ⋮ Starting algorithms for a class of RK methods for index-2 DAEs ⋮ An efficient scheme for the implementation of implicit Runge-Kutta methods ⋮ Stabilized starting algorithms for collocation Runge-Kutta methods. ⋮ Stage value predictors for additive and partitioned Runge-Kutta methods ⋮ Variable-order starting algorithms for implicit Runge-Kutta methods on stiff problems ⋮ Additive Runge-Kutta schemes for convection-diffusion-reaction equations ⋮ Starting algorithms for low stage order RKN methods

This page was built for publication: On the starting algorithms for fully implicit Runge-Kutta methods