Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Correctly rounded multiplication by arbitrary precision constants

Nicolas Brisebarre 1 Jean-Michel Muller 1 
1 ARENAIRE - Computer arithmetic
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
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 accumulate 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 the multiplication is not correctly rounded.
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 9:06:52 PM
Last modification on : Wednesday, October 26, 2022 - 8:15:10 AM


  • HAL Id : inria-00070649, version 1


Nicolas Brisebarre, Jean-Michel Muller. Correctly rounded multiplication by arbitrary precision constants. [Research Report] RR-5354, LIP RR-2004-44, INRIA, LIP. 2004, pp.14. ⟨inria-00070649⟩



Record views


Files downloads