Skip to Main content Skip to Navigation
Other publications

Emulation of a FMA and correctly-rounded sums: proved algorithms using rounding to odd

Sylvie Boldo 1 Guillaume Melquiond 2
1 PROVAL - Proof of Programs
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR
2 ARENAIRE - Computer arithmetic
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
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.
Complete list of metadata

https://hal-ens-lyon.archives-ouvertes.fr/inria-00080427
Contributor : Sylvie Boldo Connect in order to contact the contributor
Submitted on : Friday, June 16, 2006 - 3:16:15 PM
Last modification on : Tuesday, November 23, 2021 - 1:40:13 PM
Long-term archiving on: : Monday, April 5, 2010 - 10:56:59 PM

Identifiers

  • HAL Id : inria-00080427, version 1

Collections

Citation

Sylvie Boldo, Guillaume Melquiond. Emulation of a FMA and correctly-rounded sums: proved algorithms using rounding to odd. 2006. ⟨inria-00080427v1⟩

Share

Metrics

Record views

66

Files downloads

270