Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CORR
2007
Springer

favoriteEmaildiscussreport

110views Education» more CORR 2007»

Computing Integer Powers in Floating-Point Arithmetic

13 years 4 months ago

Computing Integer Powers in Floating-Point Arithmetic

Download www.vinc17.org

We introduce two algorithms for accurately evaluating powers to a positive integer in ﬂoating-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).

Peter Kornerup, Vincent Lefèvre, Jean-Miche

Real-time Traffic

Algorithm | CORR 2007 | Double Precision | Education | Positive Integer |

claim paper

Related Content

» Floating Point to Fixed Point Conversion of C Code

» Decimal FloatingPoint Adder and Multifunction Unit with InjectionBased Rounding

» A versatile computation module for adaptable multimedia processors

» Multiplications of Floating Point Expansions

» 16bit Floating Point Instructions for Embedded Multimedia Applications

» The Vector FloatingPoint Unit in a Synergistic Processor Element of a CELL Processor

» An algorithm to solve integer linear systems exactly using numerical methods

» Exact and Approximated Error of the FMA

» Inner and outer rounding of Boolean operations on lattice polygonal regions

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	CORR
Authors	Peter Kornerup, Vincent Lefèvre, Jean-Michel Muller

Comments (0)