Minimum asymptotic error of algorithms for solving ODE
This paper extends previous results of the author [Numer. Math. 45, 93- 104 (1984; Zbl 0527.65055) and J. Complexity 3, 451-465 (1987; Zbl 0643.65033)] concerned with the error of some algorithms for the numerical solution ordinary differential operations. Here the error is to be understood as the largest value of the difference between the real and the computed solution of the initial value problem \(y'=f(y,t)\), \(y(t_ 0)=y_ 0\), \(t\in [0,c]\) when f belongs to a space of functions with r continuous bounded derivatives. First, assuming that the algorithms are dependent on f through the values of n linear continuous functionals at f, it is proved that the error cannot converge to zero faster than \(n^{-r}\) as \(n\to +\infty\) and this minimal error is achieved by the Taylor algorithm. Finally, for arbitrary linear functionals, the optimal error bounds are of order \(n^{-(r+1)}\) when \(n\to +\infty\).
- Asymptotic error of algorithms for solving nonlinear problems
- How to increase the order to get minimal-error algorithms for systems of ODE
- scientific article; zbMATH DE number 52120 (Why is no real title available?)
- scientific article; zbMATH DE number 3416378 (Why is no real title available?)
- scientific article; zbMATH DE number 3182507 (Why is no real title available?)
- Optimal solution of ordinary differential equations
- Minimum relative error approximations for 1/t
- Efficient finite-dimensional solution of initial value problems in infinite-dimensional Banach spaces
- Optimal global approximation of jump-diffusion SDEs via path-independent step-size control
- Asymptotic setting (revisited): analysis of a boundary-value problem and a relation to a classical approximation result
- Optimal global approximation of systems of jump-diffusion SDEs on equidistant mesh
- On the optimal robust solution of IVPs with noisy information
- Optimal global approximation of stochastic differential equations with additive Poisson noise
- Optimal approximation of stochastic integrals with respect to a homogeneous Poisson process
- scientific article; zbMATH DE number 3905770 (Why is no real title available?)
- Adaptive mesh point selection for the efficient solution of scalar IVPs
- Randomized and quantum algorithms yield a speed-up for initial-value problems
- On sequential and parallel solution of initial value problems
This page was built for publication: Minimum asymptotic error of algorithms for solving ODE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114351)
