On sequential and parallel solution of initial value problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3688714 (Why is no real title available?)
- scientific article; zbMATH DE number 44104 (Why is no real title available?)
- Adaption helps for some nonconvex classes
- Bisection is optimal
- Can adaption help on the average?
- How to increase the order to get minimal-error algorithms for systems of ODE
- Minimum asymptotic error of algorithms for solving ODE
- On the Power of Adaptive Information for Functions with Singularities
- On the optimal error of algorithms for solving scalar autonomous ODE
- Probabilistic setting of information-based complexity
Cited in
(11)- Perspectives on information-based complexity
- High dimensional numerical problems
- Optimality of Euler-type algorithms for approximation of stochastic differential equations with discontinuous coefficients
- Information-based numerical practice
- Discussion on “An effective method for the explicit solution of sequential problems on the real line” by Sören Christensen
- Randomized and quantum algorithms yield a speed-up for initial-value problems
- Parallel information-based complexity
- Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information
- A parallel method to solve the initial value problem
- On adaption with noisy information
- Adaptive mesh point selection for the efficient solution of scalar IVPs
This page was built for publication: On sequential and parallel solution of initial value problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911713)
