On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic - Archive ouverte HAL Access content directly
Journal Articles Numerical Algorithms Year : 2015

On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic

(1) , (2) , (2)
1
2
Stef Graillat
Vincent Lefèvre
Jean-Michel Muller

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.

Dates and versions

ensl-00945033 , version 1 (11-02-2014)
ensl-00945033 , version 2 (17-10-2014)

Identifiers

• HAL Id : ensl-00945033 , version 2
• ARXIV :
• DOI :

Cite

Stef Graillat, Vincent Lefèvre, Jean-Michel Muller. On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic. Numerical Algorithms, 2015, 70 (3), pp.653-667. ⟨10.1007/s11075-015-9967-8⟩. ⟨ensl-00945033v2⟩

511 View