On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic
From MaRDI portal
Publication:891788
DOI10.1007/S11075-015-9967-8zbMATH Open1330.65068arXiv1402.2991OpenAlexW2162796876WikidataQ114224357 ScholiaQ114224357MaRDI QIDQ891788FDOQ891788
Stef Graillat, Vincent Lefèvre, Jean-Michel Muller
Publication date: 17 November 2015
Published in: Numerical Algorithms (Search for Journal in Brave)
Abstract: In this paper, 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.
Full work available at URL: https://arxiv.org/abs/1402.2991
Cites Work
- Title not available (Why is that?)
- Accuracy and Stability of Numerical Algorithms
- Improved error bounds for inner products in floating-point arithmetic
- Error estimation of floating-point summation and dot product
- Handbook of Floating-Point Arithmetic
- Accurate Floating-Point Product and Exponentiation
- On relative errors of floating-point operations: Optimal bounds and applications
Cited In (5)
- On the Possibility of Increasing the Accuracy of Computations in the Floating-Point Format with Multiple Exponents
- Improved error bounds for floating-point products and Horner's scheme
- Computing correctly rounded integer powers in floating-point arithmetic
- Title not available (Why is that?)
- Error bounds on complex floating-point multiplication with an FMA
Uses Software
This page was built for publication: On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891788)
