| Identifiant de l'article : |
 |
inria-00080427, version 2 |
|
|
| Domaine : |
|
|
|
|
| Titre : |
|
Emulation of a FMA and correctly-rounded sums: proved algorithms using rounding to odd |
|
|
| Auteur(s) : |
|
Sylvie Boldo1, Guillaume Melquiond2 |
|
|
| Laboratoire : |
|
| 1 : |
INRIA Futurs - PROVAL |
|
| 2 : |
Inria Grenoble Rhône-Alpes / LIP Laboratoire de l'Informatique du Parallélisme - ARENAIRE |
|
|
|
| Résumé : |
|
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. |
|
|
|
Langue du texte
intégral : |
|
Anglais |
|
|
| Mots-clés : |
|
Floating-point – Rounding to odd – Accurate summation – FMA – Formal proof – Coq |
|
|
Récupérer au format
