Skip to main content
Log in

Über die Stabilität und Konvergenz numerischer Algorithmen Teil II

Stability and convergence of numeric algorithms. Part II

  • Published:
Computing Aims and scope Submit manuscript

Zusammenfassung

Es werden explizite Schranken angegeben für den Abbrechindex und für die Fehlerschranke von Algorithmen, wie sie in Teil I untersucht wurden. Weiterhin wird ein Zusammenhang zwischen der Theorie von Teil I und der Theorie von Dahlquist untersucht.

Abstract

We derive explicit bounds for the termination index and for the error bound of algorithms as they were studied in part I. Furthermore, we analyze a relation between the theory of part I and the theory of Dahlquist.

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

Access this article

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

Instant access to the full article PDF.

Literatur

  1. Apostolatos, N., et al.: The algorithmic language Triplex-ALGOL 60. Numer. Math.11, 175 to 180 (1968).

    Google Scholar 

  2. Babuška, I., Práger, M., Vitásek, E.: Numerical processes in differential equations. London: J. Wiley 1966.

    Google Scholar 

  3. Dahlquist, G.: Convergence and stability in the numerical integration of ordinary differential equations. Math. Scand.4, 33–53 (1956).

    Google Scholar 

  4. Dahlquist, G.: Stability and error bounds in the numerical integration of ordinary differential equations Trans. Roy. Inst. Technol. Stockholm, Nr. 130, 1959.

  5. Nickel, K., Ritter, K.: Termination criterion and numerical convergence. SIAM J. Numer. Anal.9, 277–283 (1972).

    Google Scholar 

  6. Stummel, F.: Discrete convergence of mappings. Proceedings of the Conference on Numerical Analysis, Dublin, August 1972. New York-London: Academic Press 1973.

    Google Scholar 

  7. Wilkinson, J. H.: Rounding errors in algebraic processes. London: H. M. S. O. 1963.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nickel, K. Über die Stabilität und Konvergenz numerischer Algorithmen Teil II. Computing 15, 311–328 (1975). https://doi.org/10.1007/BF02260316

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Navigation