Advertisement

BIT Numerical Mathematics

, Volume 10, Issue 2, pp 217–227 | Cite as

Some relationships between implicit Runge-Kutta, collocation and Lanczosτ methods, and their stability properties

  • K. Wright
Article

Abstract

In this paper relationships between various one-step methods for the initial value problem in ordinary differential equations are discussed and a unified treatment of the stability properties of the methods is given. The analysis provides some new results on stability as well as alternative derivations for some known results. The term stability is used in the sense ofA-Stability as introduced by Dahlquist. Conditions for any polynomial collocation method or its equivalent to beA-Stable are derived. These conditions may be easily checked in any particular case.

Keywords

Differential Equation Ordinary Differential Equation Computational Mathematic Stability Property Collocation 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    O. Axelsson,A Class of A-Stable Methods, BIT 9 (1969), 185–199.Google Scholar
  2. 2.
    J. C. Butcher,Implicit Runge-Kutta Processes, Math. Comp. 18 (1964), 50–64.Google Scholar
  3. 3.
    J. C. Butcher,Integration Processes Based on Radau Quadrature Formulas, Math. Comp. 18 (1964), 233–244.Google Scholar
  4. 4.
    L. Collatz,The Numerical Treatment of Differential Equations, (2nd English Ed.) Springer, Berlin (1960).Google Scholar
  5. 5.
    G. J. Cooper,Interpolation and Quadrature Methods for Ordinary Differential Equations, Math. Comp. 22 (1968), 69–73.Google Scholar
  6. 6.
    C. F. Curtiss and J. O. Hirschfelder,Integration of Stiff Equations, Proc. Nat. Acad. Sci. U.S. (1952), 235–243.Google Scholar
  7. 7.
    G. G. Dahlquist,A special stability problem for linear multistep methods, BIT 3 (1963), 27–43.Google Scholar
  8. 8.
    B. L. Ehle,High Order A-Stable Methods for the Numerical Solution of Systems of Differential Equations, BIT 8 (1968), 276–278.Google Scholar
  9. 9.
    F. R. Gantmacher,Matrix Theory, Vol. II, Chelsea, New York (1959).Google Scholar
  10. 10.
    C. W. Gear,The Automatic Integration of Stiff Ordinary Differential Equations, Proc. I.F.I.P. Congress (preprint) (1968), A81–A85.Google Scholar
  11. 11.
    C. Lanczos,Trigonometric Interpolation of Empirical and Analytical Functions, J. Math. Phys. 17 (1938), 123–199.Google Scholar
  12. 12.
    C. Lanczos,Tables of Chebyshev Polynomials (Introduction), Nat. Bur. Stand. Appl. Math. Ser. 9 (1952).Google Scholar
  13. 13.
    G. J. Makinson,Stable High Order Implicit Methods for the Numerical Solution of Systems of Differential Equations, Comp. J. 11 (1968), 305–310.Google Scholar
  14. 14.
    H. Mineur,Techniques de Calcul Numerique, Beranger, Paris (1952).Google Scholar
  15. 15.
    M. R. Osborne,A New Method for the Integration of Stiff Systems of Ordinary Differential Equations, Proc. IFIP Congress (preprint) (1968), A86–A90.Google Scholar

Copyright information

© BIT Foundations 1970

Authors and Affiliations

  • K. Wright
    • 1
  1. 1.Computing LaboratoryUniversity of Newcastle Upon TyneEngland

Personalised recommendations