Abstract
The day is coming when information about the propagation of roundoff error in certain types of numerical methods can be determined automatically. This paper investigates the possibility of mechanizing simple Wilkinson-type roundoff analyses. Limitations to the scope of this automation are discussed.
Zusammenfassung
Der Tag ist nahe, daß Information über die Fortpflanzung von Rundungsfehlern in gewissen Typen von numerischen Methoden automatisch bestimmt werden kann. Dieser Artikel untersucht die Möglichkeit, einfache Rundungsanalysen vom Wilkinsonschen Typ zu mechanisieren. Die Grenzen der Möglichkeiten solcher Automatisierung werden diskutiert.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Babuska, I.: Numerical stability in problems of linear algebra. SIAM J. Numer. Anal.9, 53–77 (1972).
Bauer, F.: Numerische Abschätzung und Berechnung von Eigenwerten nichtsymmetrischer Matrizen. Aplikace Mathematiky10, 178–189 (1965).
Collins, G. E.: Efficient quantifier elimination for elementary algebra. Symposium on Complexity of Sequential and Parallel Algorithms, Carnegie-Mellon University, May 16, 1973.
Forsythe, G., and G. Moler: Computer Solution of Linear Algebraic Systems. Prentice-Hall, Englewood Cliffs, New Jersey. 1967.
Isaacson, E. and H. B. Keller: Analysis of Numerical Methods. New York: Wiley. 1966.
Kahan, W.: A survey of error analysis. 1971 IFIP Congress, pp. 1214–1239, North Holland, Amsterdam, 1972.
Kahan, W.: One numerical analyst's experience with one symbol manipulator, abstract to appear in SIAM Review.
Kim, G. D.: Statistical study of the rounding errors of some algebraic transformations. U.S.S.R., Comp. Math. and Math. Phy.9, 239–246 (1969).
Knuth, D. E.: The Art of Computer Programming, Vol. II, Addison-Wesley, Reading, Mass. 1968.
Meinguet, J.: On the estimation of significance, in: Topics in Interval Analysis (Hansen, E., ed.), pp. 47–64, Oxford: Clarendon Press. 1969.
Miller, W.: On the stability of finite numerical procedures. Numer. Math.19, 425–432 (1972).
Miller, W.: Automatic a priori roundoff analysis. Computing10, 97–106 (1972).
Miller, W.: Automatic verification of numerical stability. IBM technical report RC 4091, 1972.
Miller, W.: Toward mechanical verification of properties of roundoff error propagation. Fifth ACM Symposium on Theory of Computing, Austin, Texas, April 30, 1973.
Miller, W.: Numerical heuristics in computer-assisted roundoff analysis. IBM technical report RC 4332, 1973.
Moore, R.: Interval Analysis. Englewood Cliffs, N. J.: Prentice-Hall. 1966.
Richman, P. L.: Automatic error analysis for determining precision. Comm. A.C.M.15, 813–817 (1972).
Tarski, A.: A Decision Method for Elementary Algebra and Geometry. University of California Press. 1951.
Wilkinson, J. H.: Rounding Error in Algebraic Processes. Englewood Cliffs, N. J.: Prentice-Hall. 1963.
Wilkinson, J. H.: The Algebraic Eigenvalue Problem. Oxford: Clarendon Press. 1965.
Wilkinson, J. H.: Modern error analysis. SIAM Review13, 548–568 (1971).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Miller, W. Remarks on the complexity of roundoff analysis. Computing 12, 149–161 (1974). https://doi.org/10.1007/BF02260371
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02260371