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.
Literatur
Apostolatos, N., et al.: The algorithmic language Triplex-ALGOL 60. Numer. Math.11, 175 to 180 (1968).
Babuška, I., Práger, M., Vitásek, E.: Numerical processes in differential equations. London: J. Wiley 1966.
Dahlquist, G.: Convergence and stability in the numerical integration of ordinary differential equations. Math. Scand.4, 33–53 (1956).
Dahlquist, G.: Stability and error bounds in the numerical integration of ordinary differential equations Trans. Roy. Inst. Technol. Stockholm, Nr. 130, 1959.
Nickel, K., Ritter, K.: Termination criterion and numerical convergence. SIAM J. Numer. Anal.9, 277–283 (1972).
Stummel, F.: Discrete convergence of mappings. Proceedings of the Conference on Numerical Analysis, Dublin, August 1972. New York-London: Academic Press 1973.
Wilkinson, J. H.: Rounding errors in algebraic processes. London: H. M. S. O. 1963.
Author information
Authors and Affiliations
Rights 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
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02260316