BIT Numerical Mathematics

, Volume 19, Issue 4, pp 476–481 | Cite as

On the convergence of advanced linear multistep methods

  • S. McKee
  • N. Pitcher


A convergence theorem is given showing that zero-stable advanced linear multistep methods with orderp consistency have orderp convergence.


Computational Mathematic Convergence Theorem Multistep Method Linear Multistep Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. W. Daniel,Nonlinear equations arising in deferred correction of initial value problems, MRC Rep. 818, (1967).Google Scholar
  2. 2.
    P. A. W. Holyhead, S. McKee, and P. J. Taylor,Multistep methods for solving linear Volterra integral equations of the first kind, SINUM 2, No. 5 (1975), 698–711.Google Scholar
  3. 3.
    S. McKee,The linear algebra of discretisation methods (submitted for publication).Google Scholar
  4. 4.
    Hans J. Stetter,Analysis of Discretisation for Ordinary Differential Equations, Springer, Berlin - Heidelberg - New York (1973).Google Scholar
  5. 5.
    J. Williams and F. de Hoog,A Class of A-stable advanced multistep methods, Math. Comp. 28, no. 125 (1974), 163–177.Google Scholar

Copyright information

© BIT Foundations 1979

Authors and Affiliations

  • S. McKee
    • 1
    • 2
  • N. Pitcher
    • 1
    • 2
  1. 1.Hertford CollegeOxfordEngland
  2. 2.The Queen's CollegeOxfordEngland

Personalised recommendations