 |
 |
 |
 |
Conference papers
Correctly rounded multiplication by arbitrary precision constants
Abstract : We introduce an algorithm for multiplying a floating-point number $x$ by a constant $C$ that is not exactly representable in floating-point arithmetic. Our algorithm uses a multiplication and a fused multiply and add instruction. We give methods for checking whether, for a given value of $C$ and a given floating-point format, our algorithm returns a correctly rounded result for any $x$. When it does not, our methods give the values $x$ for which it does not.
Cited literature [10 references]
https://hal-ens-lyon.archives-ouvertes.fr/ensl-00000010
Contributor : Jean-Michel Muller <>
Submitted on : Thursday, April 13, 2006 - 10:43:28 AM
Last modification on : Friday, June 25, 2021 - 3:40:03 PM
Long-term archiving on: : Saturday, April 3, 2010 - 10:17:10 PM
Contributor : Jean-Michel Muller <>
Submitted on : Thursday, April 13, 2006 - 10:43:28 AM
Last modification on : Friday, June 25, 2021 - 3:40:03 PM
Long-term archiving on: : Saturday, April 3, 2010 - 10:17:10 PM