Computational Complexity of One-Step Methods for Systems of Differential Equations

DOI10.2307/2006225zbMath0435.65066OpenAlexW4234682555MaRDI QIDQ3875248

Arthur G. Werschulz

Publication date: 1980

Full work available at URL: https://doi.org/10.2307/2006225

zbMATH Keywords

comparisonTaylor seriesinformational costcombinatory costasymptotic analysis of optimal costsefficient evaluation algorithmsexplicit Runge- Kutta methodsfirst order differential equation systemglobal error behaviour

Mathematics Subject Classification ID

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

Related Items

Computational complexity of integrating ordinary differential equations, Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems, On the optimal error of algorithms for solving scalar autonomous ODE, Computational complexity of one-step methods for a scalar autonomous differential equation

Cites Work

• An Order Bound for Runge–Kutta Methods
• Fast Algorithms for Manipulating Formal Power Series
• Some Explicit Runge”Kutta Methods of High Order
• Implicit Runge-Kutta Processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item