| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
Emulation of a FMA and correctly-rounded sums: proved algorithms using rounding to odd
Abstract : Rounding to odd is a non-standard rounding on floating-point numbers. By using it for some intermediate values instead of rounding to nearest, correctly rounded results can be obtained at the end of computations. We present an algorithm to emulate the fused multiply-and-add operator. We also present an iterative algorithm for computing the correctly rounded sum of a set floating-point numbers under mild assumptions. A variation on both previous algorithms is the correctly rounded sum of any three floating-point numbers. This leads to efficient implementations, even when this rounding is not available. In order to guarantee the correctness of these properties and algorithms, we formally proved them using the Coq proof checker.
Cited literature [20 references]
https://hal-ens-lyon.archives-ouvertes.fr/inria-00080427
Contributor : Guillaume Melquiond <>
Submitted on : Wednesday, November 10, 2010 - 2:45:24 PM
Last modification on : Wednesday, September 16, 2020 - 5:04:55 PM
Long-term archiving on: : Friday, October 26, 2012 - 3:25:25 PM
Contributor : Guillaume Melquiond <>
Submitted on : Wednesday, November 10, 2010 - 2:45:24 PM
Last modification on : Wednesday, September 16, 2020 - 5:04:55 PM
Long-term archiving on: : Friday, October 26, 2012 - 3:25:25 PM
File
odd-rounding.pdf
Files produced by the author(s)