Implications of order reduction for implicit Runge-Kutta methods (Q1200542)
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 95469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Implications of order reduction for implicit Runge-Kutta methods |
scientific article; zbMATH DE number 95469 |
Statements
Implications of order reduction for implicit Runge-Kutta methods (English)
0 references
16 January 1993
0 references
A review on some stability concepts for Runge-Kutta methods is presented and formulas of the local error for the Prothero-Robinson test problem \(y'=\lambda(y-g(x))+g'(x)\) are given. In order to study the phenomenon of order reduction, four implicit Runge-Kutta methods are applied to the above test problem. The numerically observed orders are discussed.
0 references
stiff differential equations
0 references
variable-step algorithms
0 references
global measure of order
0 references
observed order
0 references
stiff systems
0 references
stepsize selection algorithm
0 references
stability
0 references
local error
0 references
Prothero-Robinson test problem
0 references
order reduction
0 references
implicit Runge-Kutta methods
0 references
0 references
0 references
0 references
0 references
0.8200091123580933
0 references
0.8194984197616577
0 references
0.8169215321540833
0 references
0.8156497478485107
0 references
0.8019189834594727
0 references
