Computing Integer Powers in Floating-Point Arithmetic

05/30/2007
by   Peter Kornerup, et al.
0

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).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/15/2016

Customizable Precision of Floating-Point Arithmetic with Bitslice Vector Types

Customizing the precision of data can provide attractive trade-offs betw...
research
08/21/2023

Hierarchical Lowrank Arithmetic with Binary Compression

With lowrank approximation the storage requirements for dense data are r...
research
09/15/2022

Training Neural Networks in Single vs Double Precision

The commitment to single-precision floating-point arithmetic is widespre...
research
12/20/2021

Efficient Floating Point Arithmetic for Quantum Computers

One of the major promises of quantum computing is the realization of SIM...
research
05/17/2023

The Complexity of Diagonalization

We survey recent progress on efficient algorithms for approximately diag...
research
07/14/2022

Sound Randomized Smoothing in Floating-Point Arithmetics

Randomized smoothing is sound when using infinite precision. However, we...
research
06/03/2021

When does the Lanczos algorithm compute exactly?

In theory, the Lanczos algorithm generates an orthogonal basis of the co...

Please sign up or login with your details

Forgot password? Click here to reset