The randomized complexity of initial value problems
DOI10.1016/j.jco.2007.09.002zbMath1147.65051OpenAlexW2067048168MaRDI QIDQ2483198
Bernhard Milla, Stefan Heinrich
Publication date: 28 April 2008
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2007.09.002
Monte Carlo methods (65C05) Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Quantum stochastic calculus (81S25) Error bounds for numerical methods for ordinary differential equations (65L70) Complexity and performance of numerical algorithms (65Y20)
Related Items (25)
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
- Almost optimal solution of initial-value problems by randomized and quantum algorithms
- Optimality of Euler-integral information for solving a scalar autonomous ODE
- On the optimal error of algorithms for solving scalar autonomous ODE
- Deterministic and stochastic error bounds in numerical analysis
- Error analysis of a randomized numerical method
- Numerical methods for systems with measurable coefficients
- Monte Carlo approximation of weakly singular integral operators
- The randomized information complexity of elliptic PDE
- Weighted sums of certain dependent random variables
- Improved bounds on the randomized and quantum complexity of initial-value problems
- A quasi-randomized Runge-Kutta method
- Quasi-randomized numerical methods for systems with coefficients of bounded variation
This page was built for publication: The randomized complexity of initial value problems