Variable-order starting algorithms for implicit Runge-Kutta methods on stiff problems

DOI10.1016/S0168-9274(02)00137-XMaRDI QIDQ1861976zbMATH OpenOpenAlexFDO

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

Publication date 10 March 2003

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0168-9274(02)00137-x

zbMATH Keywords

implicit Runge-Kutta methodsNewton schemesnumerical experimentsstarting algorithmsstiff initial value problems

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 authors present a family of starting algorithms for Newton schemes for solving the equations in an implicit Runge-Kutta method. The algorithm is based on the Lagrangian interpolation of the last two integration steps. They show by numerical experiments that the technique improves the performance of implicit Runge-Kutta methods for stiff problems.

Recommendations

• On the starting algorithms for fully implicit Runge-Kutta methods
• scientific article; zbMATH DE number 176990
• scientific article; zbMATH DE number 1744811
• Are high order variable step equistage initializers better than standard starting algorithms?
• Stabilized starting algorithms for collocation Runge-Kutta methods.

Cites work

• A scheme for the implementation of implicit Runge-Kutta methods
• An Efficient Solution Process for Implicit Runge–Kutta Methods
• An implementation of singly-implicit Runge-Kutta methods
• An Iteration Scheme for Implicit Runge—Kutta Methods
• Comparing numerical methods for stiff systems of O.D.E:s
• scientific article; zbMATH DE number 3911612 (Why is no real title available?)
• scientific article; zbMATH DE number 940566 (Why is no real title available?)
• Implementation of high-order implicit Runge-Kutta methods
• Iterative schemes for three-stage implicit Runge-Kutta methods
• On the implementation of implicit Runge-Kutta methods
• On the numerical solution of stiff IVPs by Lobatto IIIA Runge-Kutta methods
• On the Stability and Accuracy of One-Step Methods for Solving Stiff Systems of Ordinary Differential Equations
• On the starting algorithms for fully implicit Runge-Kutta methods
• Stabilized starting algorithms for collocation Runge-Kutta methods.
• Starting algorithms for IRK methods
• Two FORTRAN packages for assessing initial value methods

Cited in

(13)

• Stabilized starting algorithms for collocation Runge-Kutta methods.
• On the starting algorithms for fully implicit Runge-Kutta methods
• Variable-order ESIRK methods for stiff differential equations
• Are high order variable step equistage initializers better than standard starting algorithms?
• A time-adaptive finite volume method for the Cahn-Hilliard and Kuramoto-Sivashinsky equations
• Stage value predictors for additive and partitioned Runge-Kutta methods
• Variable step-size selection methods for implicit integration schemes for ODEs
• scientific article; zbMATH DE number 176990 (Why is no real title available?)
• Speeding up Newton-type iterations for stiff problems
• An efficient scheme for the implementation of implicit Runge-Kutta methods
• An improved approximate Newton method for implicit Runge-Kutta formulas
• Analysis of starting approximations for implicit Runge-Kutta methods applied to ODEs based on the reverse method
• Efficient iterations for Gauss methods on second-order problems

Describes a project that uses

Uses Software

• NSDTST
• STDTST

This page was built for publication: Variable-order starting algorithms for implicit Runge-Kutta methods on stiff problems

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