Published in

Springer Verlag, Numerical Algorithms

DOI: 10.1007/s11075-015-9967-8

Links

Tools

Export citation

Search in Google Scholar

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

Journal article published in 2015 by Stef Graillat, Vincent Lefèvre, Jean-Michel Muller ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

A paraître ; International audience ; 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.