Skip to Main content Skip to Navigation
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Jean-Michel Muller Connect in order to contact the contributor
Submitted on : Thursday, April 13, 2006 - 10:43:28 AM
Last modification on : Thursday, September 29, 2022 - 2:58:07 PM
Long-term archiving on: : Saturday, April 3, 2010 - 10:17:10 PM



Jean-Michel Muller, Nicolas Brisebarre. Correctly rounded multiplication by arbitrary precision constants. ARITH'17, 17th IEEE Symposium on Computer Arithmetic, EEE Computer Society Technical Committee on VLSI, Jun 2005, Cape Cod, United States. ⟨10.1109/ARITH.2005.13⟩. ⟨ensl-00000010⟩



Record views


Files downloads