How to increase the order to get minimal-error algorithms for systems of ODE-Reference-Cited by-同舟云学术

How to increase the order to get minimal-error algorithms for systems of ODE

Published:1984-02 Issue:1 Volume:45 Page:93-104
ISSN:0029-599X
Container-title:Numerische Mathematik
language:en
Short-container-title:Numer. Math.

Author:

Kacewicz B. Z.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics

Link

http://link.springer.com/content/pdf/10.1007/BF01379663.pdf

Reference8 articles.

1. Babenko, K.I.: Theoretical foundations and construction of computational algorithms for the problems of mathematical physics, Moscow, 1979 (in Russian)

2. Gear, C.W.: Numerical initial value problems in ordinary differential equations. Englewood Cliffs: Prentice Hall 1971

3. Hall, G., Watt, J.M.: Modern numerical methods for ordinary differential equations. Oxford: Clarendon Press 1976

4. Henrici, P.: Discrete variable methods in ordinary differential equations. New York-London: J. Wiley and Sons 1962

5. Kacewicz, B.Z.: On the optimal error of algorithms for solving a scalar autonomous ODE. BIT22, 503?518 (1982)

Cited by 31 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient finite-dimensional solution of initial value problems in infinite-dimensional Banach spaces;Journal of Mathematical Analysis and Applications;2019-03

2. On the Complexity of Parametric ODEs and Related Problems;Contemporary Computational Mathematics - A Celebration of the 80th Birthday of Ian Sloan;2018

3. Complexity of certain nonlinear two-point BVPs with Neumann boundary conditions;Journal of Complexity;2017-02

4. Solving systems of IVPs with discontinuous derivatives—Numerical experiments;Journal of Computational and Applied Mathematics;2015-12

5. On the optimal robust solution of IVPs with noisy information;Numerical Algorithms;2015-06-07