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
International audienceThe accuracy analysis of complex floating-point multiplication done by Brent, ...
Abstract. The accuracy analysis of complex floating-point multiplication done by Brent, Percival, an...
Abstract. Given a vector of floating-point numbers with exact sum s, we present an algorithm for cal...
International audienceWe introduce several algorithms for accurately evaluating powers to a positive...
International audienceWe introduce several algorithms for accurately evaluating powers to a positive...
23 pagesWe introduce several algorithms for accurately evaluating powers to a positive integer in fl...
Laboratoire LIP : CNRS/ENS Lyon/INRIA/Université Lyon 1We introduce two algorithms for accurately ev...
23 pagesWe introduce several algorithms for accurately evaluating powers to a positive integer in fl...
Laboratoire LIP : CNRS/ENS Lyon/INRIA/Université Lyon 1We introduce two algorithms for accurately ev...
International audienceRounding to odd is a non-standard rounding on floating-point numbers. By using...
We introduce an algorithm for multiplying a floating-point number x by a constant C that is not exac...
(eng) We introduce an algorithm for multiplying a floating-point number $x$ by a constant $C$ that i...
International audienceRounding to odd is a non-standard rounding on floating-point numbers. By using...
International audienceThe accuracy analysis of complex floating-point multiplication done by Brent, ...
International audienceThe accuracy analysis of complex floating-point multiplication done by Brent, ...
International audienceThe accuracy analysis of complex floating-point multiplication done by Brent, ...
Abstract. The accuracy analysis of complex floating-point multiplication done by Brent, Percival, an...
Abstract. Given a vector of floating-point numbers with exact sum s, we present an algorithm for cal...
International audienceWe introduce several algorithms for accurately evaluating powers to a positive...
International audienceWe introduce several algorithms for accurately evaluating powers to a positive...
23 pagesWe introduce several algorithms for accurately evaluating powers to a positive integer in fl...
Laboratoire LIP : CNRS/ENS Lyon/INRIA/Université Lyon 1We introduce two algorithms for accurately ev...
23 pagesWe introduce several algorithms for accurately evaluating powers to a positive integer in fl...
Laboratoire LIP : CNRS/ENS Lyon/INRIA/Université Lyon 1We introduce two algorithms for accurately ev...
International audienceRounding to odd is a non-standard rounding on floating-point numbers. By using...
We introduce an algorithm for multiplying a floating-point number x by a constant C that is not exac...
(eng) We introduce an algorithm for multiplying a floating-point number $x$ by a constant $C$ that i...
International audienceRounding to odd is a non-standard rounding on floating-point numbers. By using...
International audienceThe accuracy analysis of complex floating-point multiplication done by Brent, ...
International audienceThe accuracy analysis of complex floating-point multiplication done by Brent, ...
International audienceThe accuracy analysis of complex floating-point multiplication done by Brent, ...
Abstract. The accuracy analysis of complex floating-point multiplication done by Brent, Percival, an...
Abstract. Given a vector of floating-point numbers with exact sum s, we present an algorithm for cal...