On roundoff error distributions in floating point and logarithmic arithmetic (Q761018): Difference between revisions

Probabilistic models of floating point and logarithmic arithmetic are constructed using assumptions with both theoretical and empirical justification. The justification of these assumptions resolves open questions of \textit{R. W. Hamming} [Bell Syst. Tech. J. 49, 1609-1625 (1970; Zbl 0211.467)] and \textit{J. Bustoz}, \textit{A. Feldstein}, \textit{R. Goodman} and \textit{S. Linnainmaa} [J. Assoc. Comput. Mach. 26, 716-730 (1979; Zbl 0429.65038)]. These models are applied to errors from sums and inner products. A comparison is made between the error analysis properties of floating point and logarithmic computers. We conclude that the logarithmic computer has smaller error confidence intervals for roundoff errors than a floating point computer with the same computer word size and approximately the same number range.