Computing Integer Powers in Floating-Point Arithmetic

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).
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00150406
Contributor : Jean-Michel Muller <>
Submitted on : Wednesday, May 30, 2007 - 1:27:16 PM
Last modification on : Friday, August 23, 2019 - 3:20:03 PM
Long-term archiving on : Thursday, April 8, 2010 - 5:09:51 PM

Files

RRpower.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : ensl-00150406, version 1
  • ARXIV : 0705.4369

Collections

Citation

Peter Kornerup, Vincent Lefèvre, Jean-Michel Muller. Computing Integer Powers in Floating-Point Arithmetic. 2007. ⟨ensl-00150406⟩

Share

Metrics

Record views

380

Files downloads

245