Are high order variable step equistage initializers better than standard starting algorithms?

DOI10.1016/J.CAM.2003.12.018MaRDI QIDQ1877181zbMATHOpenAlexFDO

Authors M. Calvo, A. M. Portillo

Publication date 16 August 2004

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

Full work available at URL https://doi.org/10.1016/j.cam.2003.12.018

zbMATH Keywords

numerical resultscomparison of methodsstarting algorithmsRADAUSvariable step implicit Runge-Kutta methods

Mathematics Subject Classification ID

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

Recommendations

• Two-step high order starting values for implicit Runge--Kutta methods
• Variable-order starting algorithms for implicit Runge-Kutta methods on stiff problems
• New runge kutta starters for multistep methods
• scientific article; zbMATH DE number 176990
• A variable order Runge-Kutta method for initial value problems with rapidly varying right-hand sides

Cites work

• scientific article; zbMATH DE number 176990 (Why is no real title available?)
• scientific article; zbMATH DE number 702482 (Why is no real title available?)
• scientific article; zbMATH DE number 1745051 (Why is no real title available?)
• scientific article; zbMATH DE number 940566 (Why is no real title available?)
• scientific article; zbMATH DE number 3999169 (Why is no real title available?)
• A new interpolation procedure for adapting Runge-Kutta methods to delay differential equations
• Backward Error Analysis for Numerical Integrators
• Construction of starting algorithms for the RK-Gauss methods
• High order starting iterates for implicit Runge-Kutta methods: An improvement for variable-step symplectic integrators
• IRK methods for DAE: Starting algorithms
• On the starting algorithms for fully implicit Runge-Kutta methods
• Solving Ordinary Differential Equations I
• Stage Value Predictors and Efficient Newton Iterations in Implicit Runge--Kutta Methods
• Starting algorithms for IRK methods
• Starting algorithms for low stage order RKN methods
• Starting algorithms for some DIRK methods
• The use of Butcher series in the analysis of Newton-like iterations in Runge-Kutta formulas
• Two-step high order starting values for implicit Runge--Kutta methods
• Variable time step integration with symplectic methods
• Variable-order starting algorithms for implicit Runge-Kutta methods on stiff problems

Cited in

(6)

• Stage value predictors for additive and partitioned Runge-Kutta methods
• An efficient scheme for the implementation of implicit Runge-Kutta methods
• An algorithm for starting multistep methods.
• The starting procedure in variable-stepsize variable-order PECE codes
• Variable-order starting algorithms for implicit Runge-Kutta methods on stiff problems
• Initializers for RK-Gauss methods based on pseudo-symplecticity

Describes a project that uses

Uses Software

• RODAS

This page was built for publication: Are high order variable step equistage initializers better than standard starting algorithms?

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