Computational complexity of one-step methods for a scalar autonomous differential equation

DOI10.1007/BF02254863MaRDI QIDQ1258165zbMATH OpenWikidataFDO

Authors A. G. Werschulz

Publication date 1979

Published in Computing (Search for Journal in Brave)

zbMATH Keywords

Computational ComplexityOptimal AlgorithmsInitial-Value ProblemsMaximal-Order MethodsNumerical Solution of Ordinary Differential EquationRunge-Kutta Methods

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Cites work

• scientific article; zbMATH DE number 3533995 (Why is no real title available?)
• scientific article; zbMATH DE number 3545108 (Why is no real title available?)
• scientific article; zbMATH DE number 3628385 (Why is no real title available?)
• scientific article; zbMATH DE number 3434988 (Why is no real title available?)
• scientific article; zbMATH DE number 3203929 (Why is no real title available?)
• scientific article; zbMATH DE number 3248210 (Why is no real title available?)
• scientific article; zbMATH DE number 3273551 (Why is no real title available?)
• scientific article; zbMATH DE number 3182507 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• Computational Complexity of One-Step Methods for Systems of Differential Equations
• Perspectives on information-based complexity

Cited in

(1)

• Computational complexity of solving polynomial differential equations over unbounded domains

This page was built for publication: Computational complexity of one-step methods for a scalar autonomous differential equation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1258165)