Summary
Many procedures, for example Gaussian elimination with partial pivoting, have been shown to be stable in the following sense. The effect of round-off errors is to produce a computed solution which is the exact solution for slightly different data. Sometimes that is equivalent to the computed solution being close to the exact solution. In this paper we study this equivalence.
Similar content being viewed by others
References
Bauer, F. L.: Numerische Abschätzung und Berechnung von Eigenwerten nichtsymmetrischer Matrizen. Aplikace Matematiky10, 178–189 (1965).
Forsythe, G., Moler, C. B.: Computer solution of linear algebraic systems. Englewood Cliffs, N. J.: Prentice-Hall 1967.
Meinguet, J.: On the estimation of significance. In: Topics in interval analysis (E. Hansen, ed.), p. 47–64. Oxford: Clarendon Press 1969.
Miller, W.: A note on the instability of Gaussian elimination. BIT11, 422–424 (1971).
Miller, W.: Automatic a priori round-off analysis, I. Submitted.
Miller, W., Paulhamus, R.: Automatic a priori round-off analysis, II. In preparation.
Rudin, W.: Principles of mathematical analysis (second edition). New York: McGraw-Hill 1964.
Wilkinson, J. H.: The algebraic eigenvalue problem. Oxford: Clarendon Press 1965.
Author information
Authors and Affiliations
Additional information
Our research was supported in part by NSF grant GJ-797.
Rights and permissions
About this article
Cite this article
Miller, W. On the stability of finite numerical procedures. Numer. Math. 19, 425–432 (1972). https://doi.org/10.1007/BF01404925
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01404925