Optimal solution of ordinary differential equations

DOI10.1016/0885-064X(87)90011-2zbMath0643.65033OpenAlexW1975699027MaRDI QIDQ1102074

Bolesław Kacewicz

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0885-064x(87)90011-2

zbMATH Keywords

asymptotic behaviorminimum costepsilon-complexityminimum error algorithmsupper and lower bounds for the minimum errorworst case situation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Related Items

Complexity of nonlinear two-point boundary-value problems ⋮ Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information ⋮ Almost optimal solution of initial-value problems by randomized and quantum algorithms ⋮ Optimal algorithms for a problem of optimal control ⋮ Euler scheme for approximation of solution of nonlinear ODEs under inexact information ⋮ Error analysis of randomized Runge-Kutta methods for differential equations with time-irregular coefficients ⋮ Turbulence theories and statistical closure approaches ⋮ Newton's method and a mesh-independence principle for certain semilinear boundary-value problems ⋮ Truncated Milstein method for non-autonomous stochastic differential equations and its modification ⋮ On a randomized backward Euler method for nonlinear evolution equations with time-irregular coefficients ⋮ Complexity of initial-value problems for ordinary differential equations of order \(k\) ⋮ On the complexity of a two-point boundary value problem in different settings ⋮ Solving Burgers' equation with quantum computing ⋮ Noisy information for linear problems in the asymptotic setting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to increase the order to get minimal-error algorithms for systems of ODE
• Optimality of Euler-integral information for solving a scalar autonomous ODE
• Average case optimality
• A survey of information-based complexity
• Asymptotic error of algorithms for solving nonlinear problems
• Minimum asymptotic error of algorithms for solving ODE
• Stability and accuracy of time discretizations for initial value problems
• On the optimal error of algorithms for solving scalar autonomous ODE
• How powerful is continuous nonlinear information for linear problems?
• Diagonally Implicit Runge–Kutta Methods for Stiff O.D.E.’s
• The automatic integration of ordinary differential equations
• A special stability problem for linear multistep methods