A new view of the computational complexity of IVP for ODE
type: Item
instance of: scholarly article
title: A new view of the computational complexity of IVP for ODE
zbMATH Open document ID: 1020.65037
DOI: 10.1023/A:1021108323034
published in: Numerical Algorithms
publication date: 2003-03-10T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65L06
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 34A34
Mathematics Subject Classification ID: 65L50
zbMATH DE Number: 1879363
zbMATH Keywords: computational complexity
zbMATH Keywords: Hölder mean
zbMATH Keywords: adaptive step-size control
zbMATH Keywords: initial value problem
author: Robert M. Corless
reviewed by: J. D. P. Donnelly
MaRDI profile type: Publication
full work available at URL: a:1021108323034
OpenAlex ID: W1667785455
description: scientific article; zbMATH DE number 1879363