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

DOI10.1007/BF02254863zbMath0407.65031WikidataQ115392650 ScholiaQ115392650MaRDI QIDQ1258165

Arthur G. Werschulz

Publication date: 1979

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

Optimal AlgorithmsComputational ComplexityInitial-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)

Related Items (1)

Computational complexity of solving polynomial differential equations over unbounded domains

Cites Work

• Computational Complexity of One-Step Methods for Systems of Differential Equations
• Perspectives on information-based complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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