On sequential and parallel solution of initial value problems
From MaRDI portal
Publication:911713
DOI10.1016/0885-064X(90)90002-UzbMath0697.65062MaRDI QIDQ911713
Publication date: 1990
Published in: Journal of Complexity (Search for Journal in Brave)
Nonlinear ordinary differential equations and systems (34A34) Parallel numerical computation (65Y05) Numerical methods for initial value problems involving ordinary differential equations (65L05)
Related Items
Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information ⋮ Perspectives on information-based complexity ⋮ Optimality of Euler-type algorithms for approximation of stochastic differential equations with discontinuous coefficients ⋮ Parallel information-based complexity ⋮ Adaptive mesh point selection for the efficient solution of scalar IVPs ⋮ High dimensional numerical problems ⋮ Randomized and quantum algorithms yield a speed-up for initial-value problems
Cites Work
- Unnamed Item
- Unnamed Item
- Adaption helps for some nonconvex classes
- How to increase the order to get minimal-error algorithms for systems of ODE
- Can adaption help on the average?
- Probabilistic setting of information-based complexity
- Minimum asymptotic error of algorithms for solving ODE
- Bisection is optimal
- On the optimal error of algorithms for solving scalar autonomous ODE
- On the Power of Adaptive Information for Functions with Singularities
