On the starting algorithms for fully implicit Runge-Kutta methods (Q1592693)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1556489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the starting algorithms for fully implicit Runge-Kutta methods |
scientific article; zbMATH DE number 1556489 |
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
0.8821297287940979
0 references
0.865058183670044
0 references
0.8503037095069885
0 references
0.8501392602920532
0 references
