On the Computation of Correctly-Rounded Sums - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

On the Computation of Correctly-Rounded Sums

(1) , (2) , (2) , (2)
1
2
Vincent Lefèvre
Nicolas Louvet
Jean-Michel Muller

Abstract

This paper presents a study of some basic blocks needed in the design of floating-point summation algorithms. In particular, we show that among the set of the algorithms with no comparisons performing only floating-point additions/subtractions, the 2Sum algorithm introduced by Knuth is minimal, both in terms of number of operations and depth of the dependency graph. Under reasonable conditions, we also prove that no algorithms performing only round-to-nearest additions/subtractions exist to compute the round-to-nearest sum of at least three floating-point numbers. Starting from an algorithm due to Boldo and Melquiond, we also present new results about the computation of the correctly-rounded sum of three floating-point numbers.
Fichier principal
Vignette du fichier
arith19.pdf (114.83 Ko) Télécharger le fichier
Vignette du fichier
depth4.c (5.69 Ko) Télécharger le fichier
Vignette du fichier
minasm.c (13.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Other
Format : Other
Loading...

Dates and versions

inria-00367584 , version 1 (23-03-2009)
inria-00367584 , version 2 (23-03-2009)

Identifiers

  • HAL Id : inria-00367584 , version 2

Cite

Peter Kornerup, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller. On the Computation of Correctly-Rounded Sums. 19th IEEE Symposium on Computer Arithmetic - Arith'19, Jun 2009, Portland, Oregon, United States. ⟨inria-00367584v2⟩
308 View
257 Download

Share

Gmail Facebook Twitter LinkedIn More