A new view of the computational complexity of IVP for ODE (Q1862219)
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: A new view of the computational complexity of IVP for ODE |
scientific article; zbMATH DE number 1879363
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new view of the computational complexity of IVP for ODE |
scientific article; zbMATH DE number 1879363 |
Statements
A new view of the computational complexity of IVP for ODE (English)
0 references
10 March 2003
0 references
The author shows that to solve an initial value problem (IVP) to a given accuracy adaptive step-size control is never theoretically more costly than fixed step-size control and can be less costly by an unbounded factor.
0 references
computational complexity
0 references
Hölder mean
0 references
adaptive step-size control
0 references
initial value problem
0 references
