Dissemin is shutting down on January 1st, 2025

Published in

2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers

DOI: 10.1109/acssc.2007.4487226

Links

Tools

Export citation

Search in Google Scholar

Computing Integer Powers in Floating-Point Arithmetic

Journal article published in 2007 by Peter Kornerup, 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

We introduce two algorithms for accurately evaluating powers to a positive integer in floating-point arithmetic, assuming a fused multiply-add (fma) instruction is available. We show that our log-time algorithm always produce faithfully-rounded results, discuss the possibility of getting correctly rounded results, and show that results correctly rounded in double precision can be obtained if extended-precision is available with the possibility to round into double precision (with a single rounding).