Are high order variable step equistage initializers better than standard starting algorithms? (Q1877181)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Are high order variable step equistage initializers better than standard starting algorithms? |
scientific article; zbMATH DE number 2091413
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Are high order variable step equistage initializers better than standard starting algorithms? |
scientific article; zbMATH DE number 2091413 |
Statements
Are high order variable step equistage initializers better than standard starting algorithms? (English)
0 references
16 August 2004
0 references
The Butcher theory for order conditions is used to construct a fourth order starting method for variable step implicit Runge-Kutta methods of stage order three or more. The approach is based on the construction of an initial iterate for each stage that only involves values of that stage at several previous steps. An implementation with RADAUS is given but numerical results show that there is nothing to be gained in comparison with a standard collocation approach, due to the size of the error constants.
0 references
starting algorithms
0 references
comparison of methods
0 references
variable step implicit Runge-Kutta methods
0 references
RADAUS
0 references
numerical results
0 references
0 references
0 references
0 references
0.8115836977958679
0 references
0.8016493320465088
0 references
0.7813654541969299
0 references
