The approximate Runge-Kutta computational process

DOI10.1023/A:1022399225591zbMath0959.65085MaRDI QIDQ1577725

Gustaf Söderlind, Hans Olsson

Publication date: 6 May 2001

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

performancenumerical exampleserror boundsdifferential-algebraic equationsstiff systemsRunge-Kutta method

Mathematics Subject Classification ID

Implicit ordinary differential equations, differential-algebraic equations (34A09) 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) Finite element, Rayleigh-Ritz, Galerkin and collocation methods for ordinary differential equations (65L60) Numerical methods for differential-algebraic equations (65L80) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

Design and implementation of DIRK integrators for stiff systems ⋮ Time-step selection algorithms: adaptivity, control, and signal processing

This page was built for publication: The approximate Runge-Kutta computational process