Complexity of initial-value problems for ordinary differential equations of order \(k\)

DOI10.1016/j.jco.2006.03.002zbMath1105.65078OpenAlexW1989359962MaRDI QIDQ2507590

Marek Szczȩsny

Publication date: 5 October 2006

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2006.03.002

zbMATH Keywords

algorithmsworst-case complexitylinear informationstandard informationintegral informationnonlinear initial value problem\(k\)th order initial-value problems

Mathematics Subject Classification ID

Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Complexity and performance of numerical algorithms (65Y20)

Related Items

Newton's method and a mesh-independence principle for certain semilinear boundary-value problems ⋮ On the randomized solution of initial value problems ⋮ On the complexity of a two-point boundary value problem in different settings

Cites Work

• Unnamed Item
• Unnamed Item
• How to increase the order to get minimal-error algorithms for systems of ODE
• Randomized and quantum algorithms yield a speed-up for initial-value problems
• Optimal solution of ordinary differential equations
• Complexity of nonlinear two-point boundary-value problems
• Improved bounds on the randomized and quantum complexity of initial-value problems
• Numerical Solution of Ordinary Differential Equations