On the computation of correctly-rounded sums - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Computers Year : 2012

On the computation of correctly-rounded sums

(1) , (2, 3) , (3, 2) , (3, 2)
1
2
3

Abstract

This paper presents a study of some basic blocks needed in the design of floating-point summa- tion algorithms. In particular, in radix-2 floating-point arithmetic, we show that among the set of the algo- rithms with no comparisons performing only floating- point additions/subtractions, the 2Sum algorithm in- troduced by Knuth is minimal, both in terms of number of operations and depth of the dependency graph. We investigate the possible use of another algorithm, Dekker's Fast2Sum algorithm, in radix-10 arithmetic. We give methods for computing, in radix 10, the floating-point number nearest the average value of two floating-point numbers. We also prove that un- der reasonable conditions, an algorithm performing only round-to-nearest additions/subtractions cannot 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. For a few of our algorithms, we assume new operations defined by the recent IEEE 754-2008 Standard are available.
Fichier principal
Vignette du fichier
TC-2010-04-0248.R1.pdf (783.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-00331519 , version 1 (17-10-2008)
ensl-00331519 , version 2 (13-12-2010)

Identifiers

Cite

Peter Kornerup, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller. On the computation of correctly-rounded sums. IEEE Transactions on Computers, 2012, 61 (3), p. 289-298. ⟨10.1109/TC.2011.27⟩. ⟨ensl-00331519v2⟩
326 View
436 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More