Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

The computational complexity of extrapolation methods

From MaRDI portal
Publication:626884
Jump to:navigation, search

DOI10.1007/S11786-007-0040-4zbMath1205.65213OpenAlexW2029410925MaRDI QIDQ626884

Silvana Ilie, Robert M. Corless, Chris Essex

Publication date: 19 February 2011

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-007-0040-4


zbMATH Keywords

ordinary differential equationsinitial value problemsextrapolationadaptive step-size controlHölder mean


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Complexity and performance of numerical algorithms (65Y20)








This page was built for publication: The computational complexity of extrapolation methods

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:626884&oldid=12520588"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 08:17.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki