On the starting algorithms for fully implicit Runge-Kutta methods (Q1592693)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the starting algorithms for fully implicit Runge-Kutta methods |
scientific article |
Statements
On the starting algorithms for fully implicit Runge-Kutta methods (English)
0 references
25 January 2001
0 references
Two types of starting algorithms for solving the algebraic equations arising in the case of fully implicit Runge-Kutta methods for stiff initial value problems are investigated. Their order is related to their efficiency in the case of non-stiff and stiff problems and low required tolerance (global errors). Numerical experiments with four different forms of starting algorithms applied to the Van der Pol and Oregonator models illustrate the theory.
0 references
solutions of stage equations
0 references
Van der Pol equation
0 references
numerical experiments
0 references
starting algorithms
0 references
fully implicit Runge-Kutta methods
0 references
stiff initial value problems
0 references
Oregonator models
0 references
