Complexity of initial-value problems for ordinary differential equations of order k
DOI10.1016/J.JCO.2006.03.002zbMATH Open1105.65078OpenAlexW1989359962MaRDI QIDQ2507590FDOQ2507590
Authors: 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
Recommendations
- Complexity of initial-value problems for ordinary differential equations of order \(k\)-different models of computation
- Optimal solution of ordinary differential equations
- Complexity of nonlinear two-point boundary-value problems
- Randomized and quantum algorithms for solving initial-value problems in ordinary differential equations of order \(k\)
- Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information
algorithmsworst-case complexitystandard informationlinear informationintegral informationnonlinear initial value problem\(k\)th order initial-value problems
Complexity and performance of numerical algorithms (65Y20) Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05)
Cites Work
- How to increase the order to get minimal-error algorithms for systems of ODE
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity of nonlinear two-point boundary-value problems
- Randomized and quantum algorithms yield a speed-up for initial-value problems
- Numerical Solution of Ordinary Differential Equations
- Optimal solution of ordinary differential equations
- Improved bounds on the randomized and quantum complexity of initial-value problems
Cited In (6)
- Complexity of initial-value problems for ordinary differential equations of order \(k\)-different models of computation
- On the randomized solution of initial value problems
- On the computational complexity of ordinary differential equations
- Newton's method and a mesh-independence principle for certain semilinear boundary-value problems
- On the complexity of a two-point boundary value problem in different settings
- Optimal solution of ordinary differential equations
This page was built for publication: Complexity of initial-value problems for ordinary differential equations of order \(k\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2507590)