Skip to Main content Skip to Navigation

On the Computation of Correctly-Rounded Sums

Peter Kornerup 1 Vincent Lefèvre 2 Nicolas Louvet 2 Jean-Michel Muller 2
2 ARENAIRE - Computer arithmetic
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
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. 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. 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.
Document type :
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Vincent Lefèvre Connect in order to contact the contributor
Submitted on : Wednesday, April 21, 2010 - 5:56:56 PM
Last modification on : Saturday, September 11, 2021 - 3:17:35 AM
Long-term archiving on: : Tuesday, September 28, 2010 - 12:28:20 PM


Files produced by the author(s)


  • HAL Id : inria-00475279, version 1



Peter Kornerup, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller. On the Computation of Correctly-Rounded Sums. [Research Report] RR-7262, INRIA. 2010, pp.24. ⟨inria-00475279⟩



Les métriques sont temporairement indisponibles