Goodman, Richard H.; Feldstein, Alan; Bustoz, J. Relative error in floating-point multiplication. (English) Zbl 0564.65030 Computing 35, 127-139 (1985). A model of the relative error in floating point multiplication is developed and is analyzed stochastically for various choices of computer design parameters. These parameters include the base, the type of rounding rule, the number of guard digits, and whether the post- arithmetic normalization shift (if needed) is done before or after rounding. Under the assumption of logarithmic distribution for the fraction (mantissa), the major stochastic conclusions are: 1. The average relative error in multiplication increases as the base increases. 2. This error is minimized by selecting the machine based to be binary (better yet, binary with a hidden bit) and is rather large for machines with base 16. 3. The classical relative error bounds are pessimistic. The average overestimation by those bounds increases as the base increases. Cited in 2 Documents MSC: 65G50 Roundoff error Keywords:relative error; computer arithmetic; floating point multiplication; normalization options; guard digits; floating point numbers; floating point precision and significance; round-off error; fraction error; mean and standard deviation of errors; logarithmically distributed numbers × Cite Format Result Cite Review PDF Full Text: DOI References: [1] BFGL [79] Bustoz, J., Feldstein, A., Goodman, R., Linnainmaa, S.: Improved trailing digits estimates applied to optimal computer arithmetic. J. ACM26, 716–730 (1979). · Zbl 0429.65038 · doi:10.1145/322154.322162 [2] Feldstein and Goodman [76] Feldstein, A., Goodman, R..: Convergence estimates for the distribution of trailing digits. J. ACM23, 287–297 (1976). · Zbl 0324.65019 · doi:10.1145/321941.321948 [3] Goodman [81] Goodman, R.: Some models of error in floating point multiplication. Computing27, 227–236 (1981). · Zbl 0456.68052 · doi:10.1007/BF02237980 [4] Goodman and Feldstein [77] Goodman, R., Feldstein, A.: Effect of guard digits and normalization options on floating point multiplication. Computing18, 93–106 (1977). · Zbl 0362.65038 · doi:10.1007/BF02243619 [5] Henrici [62] Henrici, P.: Discrete Variable Methods in Ordinary Differential Equations. New York: Wiley 1962. · Zbl 0112.34901 [6] Kaneko and Liu [73] Kaneko, T., Liu, B.: On local roundoff errors in floating-point arithmetic. J. ACM20, 391–398 (1973). · Zbl 0265.65026 · doi:10.1145/321765.321771 [7] Knuth [69] Knuth, D. E.: The Art of Computer Programming, Vol. 2: Seminumerical Algorithms. Reading, Mass.: Addison-Wesley 1969. [8] Sterbenz [74] Sterbenz, P. H.: Floating Point Computation. Englewood Cliffs, N. J.: Prentice-Hall 1974. [9] Tsao [74] Tsao, N.-K.: On the distributions of significant digits and roundoff errors. Comm. ACM17, 269–271 (1974). · Zbl 0276.65020 · doi:10.1145/360980.360998 [10] Turner [82] Turner, P.: The distribution of leading significant digits. IMA J. of Num. Anal.2, 407–412 (1982). · Zbl 0503.65029 · doi:10.1093/imanum/2.4.407 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.