Skip to main content
SpringerLink
Log in

On the maximal order in PC-codes

Zur maximalen Ordnung bei PC-Verfahren

  • Short Communications
  • Published:
Computing Aims and scope Submit manuscript

Abstract

It is shown thatk-step PC-algorithms suffer from relative instability for systems with positive eigenvalues, at higher values ofk. This sets a natural boundary on the useful values ofk.

Zusammenfassung

Es wird gezeigt, daßk-Schritt PC-Algorithmen für größere Werte vonk bei der Anwendung auf Systeme mit positiven Eigenwerten relative Instabilität zeigen. Diese Erscheinung begrenzt die nutzbaren Werte vonk in natürlicher Weise.

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

References

  1. Stetter, H. J.: Analysis of discretization methods for ordinary differential equations. Berlin-Heidelberg-New York: Springer 1973.

    Google Scholar 

  2. Shampine, L. F., Gordon, M. K.: Computer solution of ordinary differential equations. Freeman 1975.

  3. Stetter, H. J.: Tolerance proportionality in ODE-codes (to appear).

Download references

Author information

Authors and Affiliations

  1. Institut für Numerische Mathematik, Technische Universität Wien, Gußhausstraße 27-29, A-1040, Wien, Austria

    H. J. Stetter

Authors
  1. H. J. Stetter
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stetter, H.J. On the maximal order in PC-codes. Computing 20, 273–278 (1978). https://doi.org/10.1007/BF02251951

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation