 |
 |
 |
 |
Journal articles
On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic
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.
Cited literature [7 references]
https://hal-ens-lyon.archives-ouvertes.fr/ensl-00945033
Contributor : Jean-Michel Muller <>
Submitted on : Friday, October 17, 2014 - 3:34:19 PM
Last modification on : Friday, January 8, 2021 - 5:40:03 PM
Long-term archiving on: : Sunday, January 18, 2015 - 10:35:11 AM
Contributor : Jean-Michel Muller <>
Submitted on : Friday, October 17, 2014 - 3:34:19 PM
Last modification on : Friday, January 8, 2021 - 5:40:03 PM
Long-term archiving on: : Sunday, January 18, 2015 - 10:35:11 AM
File
x-puissance-n-revision.pdf
Files produced by the author(s)