skip to main content
article
Free Access

Equilibrium states of Runge-Kutta schemes: part II

Published:01 September 1986Publication History
Skip Abstract Section

Abstract

A theory is given that accounts for the observed behavior of Runge-Kutta codes when the stepsize is restricted by stability. The theory deals with the general case when the dominant eigenvalues of the Jacobian may be a complex conjugate pair. This extends and generalizes the results of Part I of this paper, which deal with the real case. Familiarity with Part I is assumed, but not essential.

References

  1. 1 HALL, G. Equilibrium states of Runge-Kutta schemes. A CM Trans. Math. Softw. 11, 3 (Sept. 1985), 289-301. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 KROGH, F.T. On testing a subroutine for the numerical integration of ordinary differential equations. J. ACM 20, 4 (Oct. 1973), 545-562. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 SHAMPINE, L. F. Stiffness and non-stiff differential equation solvers. In Numerische Behandlung von Differential Gleichungen, L. Collatz, Ed. International Series of Numerical Mathematics, vol. 27. Birkhauser Verlag, Basel, Switzerland, 1975, pp. 287-301.Google ScholarGoogle Scholar

Index Terms

  1. Equilibrium states of Runge-Kutta schemes: part II

          Recommendations

          Reviews

          Michael Minkoff

          This paper deals with the behavior of Runge-Kutta methods when stepsize is restricted by stability requirements. In Part I (see ACM Trans. Math Softw. 11, 3 (Sept. 1985), 289–301), this requirement was studied in the case when the dominant eigenvalue of the Jacobian is real. In the current paper, this analysis is extended to the complex case, thus completing the theory. The paper presents the theory within the context of a model problem and provides numerical examples as well.

          Access critical reviews of Computing literature here

          Become a reviewer for Computing Reviews.

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM Transactions on Mathematical Software
            ACM Transactions on Mathematical Software  Volume 12, Issue 3
            Sept. 1986
            103 pages
            ISSN:0098-3500
            EISSN:1557-7295
            DOI:10.1145/7921
            Issue’s Table of Contents

            Copyright © 1986 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 September 1986
            Published in toms Volume 12, Issue 3

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader