Computational complexity of integrating ordinary differential equations

DOI10.1007/BF02366506zbMATH Open0875.65074MaRDI QIDQ1364061FDOQ1364061

P. N. Besarab

Publication date: 27 October 1997

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

Cauchy problemordinary differential equationsmultistep method

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Nonlinear ordinary differential equations and systems (34A34) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Cites Work

• Title not available (Why is that?)
• On the computational complexity of ordinary differential equations
• Parallel Computers 2
• Title not available (Why is that?)
• Computational Complexity of One-Step Methods for Systems of Differential Equations
• Title not available (Why is that?)
• On the use of parallel processors for implicit Runge-Kutta methods
• Some methods of integrating ordinary differential equations on a multiprocessor computer
• Title not available (Why is that?)
• The asymptotics for small ε of the solution of the equation ut + (ϑ(u))x = εuxx, corresponding to a rarefaction wave, in the degenerate case

Cited In (1)

• Some approaches to the analysis of computation optimization problems

This page was built for publication: Computational complexity of integrating ordinary differential equations

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