On some topological properties of numerical algorithms
- 17 Downloads
A result quantity in a numerical algorithm is considered as a function of the input data, roundoff and truncation errors. In order to investigate this functional relationship using the methods of mathematical analysis a structural model of the numerical algorithm calledR-automaton is introduced. It is shown that the functional dependence defined by anR-automaton is a continuous rational function in a neighborhood of any data point except in a point set, the Lebesgue measure of which is zero. An effective general-purpose algorithm is presented to compute the derivative of any result quantity with respect to the individual roundoff and truncation errors. Some ways of generalizing theR-automation model without losing the results achieved are finally suggested.
KeywordsInput Data Rational Function Computational Mathematic Lebesgue Measure Mathematical Analysis
Unable to display preview. Download preview PDF.
- 1.D. Bjørner,Flowchart machines, BIT 10 (1970), 415–442.Google Scholar
- 2.P. Henrici,Elements of Numerical analysis, Wiley, New York, 1964.Google Scholar
- 3.E. Isaacson and H. B. Keller,Analysis of numerical methods, Wiley, New York, 1966.Google Scholar
- 4.E. Kamke,Das Lebesgue-Stieltjes Integral, B. G. Teubner Verlagsgesellschaft, Leipzig 1956.Google Scholar
- 5.D. Knuth,The art of computer programming, vol. 2, Seminumerical algorithms, Addison-Wesley, Reading, Massachusetts, 1969.Google Scholar
- 6.S. Linnainmaa,The representation of the cumulative roundoff error of an algorithm as a Taylor-expansion of individual roundoff errors, (In Finnish language), Master's thesis, University of Helsinki, Computer Science Department, 1970.Google Scholar
- 7.R. E. Moore,Interval analysis, Prentice Hall, Englewood Cliffs, N.J., 1966.Google Scholar
- 8.M. Tienari,A statistical model of roundoff error for varying length floating-point arithmetic, BIT 10 (1970), 355–365.Google Scholar
- 9.M. V. Wilkes,The outer and inner syntax of a programming language, Computer Journal 11 (1968), 260–263.Google Scholar