On the randomized solution of initial value problems
DOI10.1016/j.jco.2010.07.002zbMath1225.65071OpenAlexW1972156125MaRDI QIDQ544122
Publication date: 14 June 2011
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2010.07.002
complexitycomparison of methodssystemsnumerical resultsMonte-Carlo algorithminitial value problemRunge-Kutta methodrandomized algorithmEuler method
Monte Carlo methods (65C05) 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 (21)
Cites Work
- Unnamed Item
- Unnamed Item
- How to increase the order to get minimal-error algorithms for systems of ODE
- Almost optimal solution of initial-value problems by randomized and quantum algorithms
- Deterministic and stochastic error bounds in numerical analysis
- The randomized complexity of initial value problems
- Monte Carlo approximation of weakly singular integral operators
- The randomized information complexity of elliptic PDE
- Complexity of initial-value problems for ordinary differential equations of order \(k\)
This page was built for publication: On the randomized solution of initial value problems