Skip to main content
SpringerLink
Log in

An implementation of singly-implicit Runge-Kutta methods

  • Part II Numerical Mathematics
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

A description is given ofSTRIDE, an algorithm for the numerical integration of ordinary differential equations. This algorithm, which is applicable to either stiff or non-stiff initial value problems, is based on the family of singly-implicit Runge-Kutta methods of Burrage [2]. The present paper is confined mainly to a theoretical discussion, but includes an overview of the structure of the algorithm together with a general description of how it is used. A companion report [5] contains more detailed documentation intended particularly for a potential user of the algorithm. The companion report also includes an Algol 60 procedure declaration forSTRIDE together with the listing of an equivalent Fortran subroutine.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. T. A. Bickart,An efficient solution process for implicit Runge-Kutta methods, SIAM J. Numer. Anal. 14 (1977), 1022–1027.

    Article  Google Scholar 

  2. K. Burrage,A special family of Runge-Kutta methods for solving stiff differential equations, BIT 18 (1978), 22–41.

    Google Scholar 

  3. J. C. Butcher,On the implementation of implicit Runge-Kutta methods, BIT 16 (1976), 237–240.

    Google Scholar 

  4. J. C. Butcher,A transformed implicit Runge-Kutta method, J. Assoc. Comput. Mach. 26 (1979).

  5. J. C. Butcher, K. Burrage, F. H. Chipman,STRIDE: Stable Runge-Kutta integrator for differential equations, Computational Mathematics Report No. 20, University of Auckland, 1979.

  6. O. MøllerQuasi double-precision in floating point addition, BIT 5 (1965), 37–50.

    Google Scholar 

  7. S. P. Nørsett,Multiple Padé approximations to the exponential function, Mathematics Department, University of Trondheim, Reprint No 4/74.

  8. J. M. Varah,On the efficient implementation of implicit Runge-Kutta methods, Department of Computer Science, Technical Report No. 78-5, University of British Columbia.

  9. A. Wolfbrandt,A study of Rosenbrock processes with respect to order conditions and stiff stability, Department of Computer Science, Chalmers University of Technology, Göteborg.

Download references

Author information

Authors and Affiliations

  1. Mathematics Division, University of Sussex, Brighton, England

    K. Burrage, J. C. Butcher & F. H. Chipman

  2. Dept. of Computer Science, University of Auckland, Auckland, New Zealand

    K. Burrage, J. C. Butcher & F. H. Chipman

  3. Department of Mathematics, Acadia University, Wolfville, Nova Scotia, Canada

    K. Burrage, J. C. Butcher & F. H. Chipman

Authors
  1. K. Burrage
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. C. Butcher
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. F. H. Chipman
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported by the National Research Council of Canada.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burrage, K., Butcher, J.C. & Chipman, F.H. An implementation of singly-implicit Runge-Kutta methods. BIT 20, 326–340 (1980). https://doi.org/10.1007/BF01932774

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01932774

Keywords

Search

Navigation