On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic
- 113 Downloads
We improve the usual relative error bound for the computation of x n through iterated multiplications by x in binary floating-point arithmetic. The obtained error bound is only slightly better than the usual one, but it is simpler. We also discuss the more general problem of computing the product of n terms.
KeywordsFloating-point arithmetic Rounding error Accurate error bound Exponentiation
Mathematics Subject Classification (2010)15-04 65G99 65-04
Unable to display preview. Download preview PDF.
- 3.IEEE Computer Society. IEEE Standard for Floating-Point Arithmetic. IEEE Standard 754–2008, August 2008. Available at http://ieeexplore.ieee.org/servlet/opac?punumber=4610933
- 4.Jeannerod, C.-P., Rump, S.M.: On relative errors of floating-point operations: optimal bounds and applications. Research report hal-00934443, available at http://hal.inria.fr/hal-00934443
- 6.Knuth, D.: The Art of Computer Programming, 3rd edition, volume 2, Seminumerical Algorithms. Addison-Wesley, Reading, MA (1998)Google Scholar
- 7.Muller, J.-M., Brisebarre, N., De Dinechin, F., Jeannerod, C.-P., Lefèvre, V., Melquiond, G., Revol, N., Stehlé, D., Torres, S.: Handbook of Floating-Point Arithmetic. Birkhäuser Boston (2010)Google Scholar