Initial-value problems: multi-step methods

L. Fox and D. F. Mayers
Additional contact information
L. Fox: Oxford University
D. F. Mayers: Oxford University

Chapter 4 in Numerical Solution of Ordinary Differential Equations, 1987, pp 78-97 from Springer

Abstract: Abstract The one-step finite-difference methods of the previous chapter, with the possible exception of the trapezoidal rule method, are basically rather too uneconomic for general use. Their local truncation error is of rather low order, with the result that to achieve good accuracy we need to use either: (a) a rather small step-by-step interval, involving many steps to cover a specified range; or (b) one of our correcting devices which involve some additional computation and more computer programming. The special one-step methods of the previous chapter, the Taylor series method and the explicit Runge-Kutta methods, do not share these disadvantages, but they involve extra computer storage, the Taylor series method involves a possibly large amount of non-automatic differentiation, and with the Runge—Kutta methods we have to compute possibly rather complicated expressions several times in each step. Moreover, both these methods have rather poor partial stability properties.

Date: 1987
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-009-3129-9_4

Ordering information: This item can be ordered from
http://www.springer.com/9789400931299

DOI: 10.1007/978-94-009-3129-9_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().