Abstract
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.
Similar content being viewed by others
References
Graillat, S.: Accurate floating point product and exponentiation. IEEE Trans. Comput. 58(7), 994–1000 (2009)
Higham, N.J. Accuracy and Stability of Numerical Algorithms, 2nd edn. SIAM, Philadelphia, PA (2002)
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
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
Jeannerod, C.-P., Rump, S.M.: Improved error bounds for inner products in floating-point arithmetic. SIAM J. Matrix Anal. Appl. 34(2), 338–344 (2013)
Knuth, D.: The Art of Computer Programming, 3rd edition, volume 2, Seminumerical Algorithms. Addison-Wesley, Reading, MA (1998)
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)
Rump, S.M.: Error estimation of floating-point summation and dot product. BIT 52(1), 201–220 (2012)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Graillat, S., Lefèvre, V. & Muller, JM. On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic. Numer Algor 70, 653–667 (2015). https://doi.org/10.1007/s11075-015-9967-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-015-9967-8