On sequential and parallel solution of initial value problems

DOI10.1016/0885-064X(90)90002-UMaRDI QIDQ911713zbMATH OpenFDO

Authors Bolesław Kacewicz

Publication date 1990

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0885-064X(90)90002-U

zbMATH Keywords

adaptationnonadaptationnumerical examplesparallel computationssequential solutions

Mathematics Subject Classification ID

Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Parallel numerical computation (65Y05)

Review text

It is well known that if the functionals are given in advance, independent of any particular f, then the information is called nonadaptive. On the other hand, if the functionals are chosen on the basis of all previously computed values then the informations are called adaptive. The main advantage of nonadaptive over adaptive information is that the former is well-suited for parallel computations, while the later is sequential. In this interesting paper the author shows that adaptation gives a much smaller error than nonadaptation. In fact, it is shown that the superiority of adaptation increases with the dimension. Several examples are given to illustrate the main ideas of the paper.

Recommendations

• scientific article; zbMATH DE number 4207930
• Can adaption help on the average?
• On the power of adaption
• On the adaptive and continuous information problems
• On adaption with noisy information

Cites work

• 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
• scientific article; zbMATH DE number 3688714 (Why is no real title available?)
• scientific article; zbMATH DE number 44104 (Why is no real title available?)
• Minimum asymptotic error of algorithms for solving ODE
• On the optimal error of algorithms for solving scalar autonomous ODE
• On the Power of Adaptive Information for Functions with Singularities
• Probabilistic setting of information-based complexity

Cited in

(12)

• Information-based numerical practice
• On adaption with noisy information
• 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
• Optimality of Euler-type algorithms for approximation of stochastic differential equations with discontinuous coefficients
• scientific article; zbMATH DE number 4207930 (Why is no real title available?)
• Perspectives on information-based complexity
• High dimensional numerical problems
• Discussion on “An effective method for the explicit solution of sequential problems on the real line” by Sören Christensen
• Adaptive mesh point selection for the efficient solution of scalar IVPs
• Randomized and quantum algorithms yield a speed-up for initial-value problems

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)