Computing correctly rounded integer powers in floating-point arithmetic | Zendy

Peter Kornerup | Zendy; Christoph Lauter | Zendy; Vincent Lefèvre | Zendy; Nicolas Louvet | Zendy; JeanMichel Muller | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Computing correctly rounded integer powers in floating-point arithmetic

Author(s) -

Peter Kornerup,

Christoph Lauter,

Vincent Lefèvre,

Nicolas Louvet,

JeanMichel Muller

Publication year - 2010

Publication title -

acm transactions on mathematical software

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.767

H-Index - 87

eISSN - 1557-7295

pISSN - 0098-3500

DOI - 10.1145/1644001.1644005

Subject(s) - floating point , integer (computer science) , arithmetic , mathematics , exponent , point (geometry) , bounded function , algorithm , discrete mathematics , computer science , mathematical analysis , geometry , linguistics , philosophy , programming language

International audienceWe introduce several algorithms for accurately evaluating powers to a positive integer in floating-point arithmetic, assuming a fused multiply-add (fma) instruction is available. For bounded, yet very large values of the exponent, we aim at obtaining correctly-rounded results in round-to-nearest mode, that is, our algorithms return the floating-point number that is nearest the exact value

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research