Minimum asymptotic error of algorithms for solving ODE

DOI10.1016/0885-064X(88)90016-7zbMath0662.65066MaRDI QIDQ1114351

Bolesław Kacewicz

Publication date: 1988

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

zbMATH Keywords

algorithmic complexityoptimal error boundsminimum asymptotic error

Mathematics Subject Classification ID

Roundoff error (65G50) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Related Items

Asymptotic setting (revisited): analysis of a boundary-value problem and a relation to a classical approximation result ⋮ Efficient finite-dimensional solution of initial value problems in infinite-dimensional Banach spaces ⋮ Optimal global approximation of systems of jump-diffusion SDEs on equidistant mesh ⋮ Optimal solution of ordinary differential equations ⋮ Optimal global approximation of stochastic differential equations with additive Poisson noise ⋮ Optimal approximation of stochastic integrals with respect to a homogeneous Poisson process ⋮ On sequential and parallel solution of initial value problems ⋮ Optimal global approximation of jump-diffusion SDEs via path-independent step-size control ⋮ Adaptive mesh point selection for the efficient solution of scalar IVPs ⋮ Randomized and quantum algorithms yield a speed-up for initial-value problems ⋮ On the optimal robust solution of IVPs with noisy information

Cites Work

• How to increase the order to get minimal-error algorithms for systems of ODE
• Asymptotic error of algorithms for solving nonlinear problems
• Unnamed Item
• Unnamed Item
• Unnamed Item