Computational complexity of integrating ordinary differential equations
From MaRDI portal
Publication:1364061
DOI10.1007/BF02366506zbMath0875.65074MaRDI QIDQ1364061
Publication date: 27 October 1997
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Nonlinear ordinary differential equations and systems (34A34) 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)
Related Items
Cites Work
- On the use of parallel processors for implicit Runge-Kutta methods
- On the computational complexity of ordinary differential equations
- Some methods of integrating ordinary differential equations on a multiprocessor computer
- Computational Complexity of One-Step Methods for Systems of Differential Equations
- Parallel Computers 2
- The asymptotics for small ε of the solution of the equation ut + (ϑ(u))x = εuxx, corresponding to a rarefaction wave, in the degenerate case
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item