How to increase the order to get minimal-error algorithms for systems of ODE
From MaRDI portal
Publication:595344
DOI10.1007/BF01379663zbMath0527.65055OpenAlexW1979190087MaRDI QIDQ595344
Publication date: 1984
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132954
Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05)
Related Items (23)
Complexity of nonlinear two-point boundary-value problems ⋮ A survey of information-based complexity ⋮ Efficient finite-dimensional solution of initial value problems in infinite-dimensional Banach spaces ⋮ Optimal solution of ordinary differential equations ⋮ Asymptotic error of algorithms for solving nonlinear problems ⋮ Complexity of certain nonlinear two-point BVPs with Neumann boundary conditions ⋮ Minimum asymptotic error of algorithms for solving ODE ⋮ Optimal solution of a class of non-autonomous initial-value problems with unknown singularities ⋮ On sequential and parallel solution of initial value problems ⋮ Strong approximation of solutions of stochastic differential equations with time-irregular coefficients via randomized Euler algorithm ⋮ On the Complexity of Parametric ODEs and Related Problems ⋮ Complexity of the derivative-free solution of systems of IVPs with unknown singularity hypersurface ⋮ Solving systems of IVPs with discontinuous derivatives-numerical experiments ⋮ Optimal adaptive solution of initial-value problems with unknown singularities ⋮ High dimensional numerical problems ⋮ Complexity of parametric initial value problems in Banach spaces ⋮ Optimal adaptive solution of piecewise regular systems of IVPs with unknown switching hypersurface ⋮ The randomized complexity of initial value problems ⋮ On the randomized solution of initial value problems ⋮ Randomized and quantum algorithms yield a speed-up for initial-value problems ⋮ Complexity of initial-value problems for ordinary differential equations of order \(k\) ⋮ Improved bounds on the randomized and quantum complexity of initial-value problems ⋮ On the optimal robust solution of IVPs with noisy information
Cites Work
This page was built for publication: How to increase the order to get minimal-error algorithms for systems of ODE
