Spring til hovednavigation Spring til søgning Spring til hovedindhold

On the computation of correctly-rounded sums

  • Peter Kornerup
  • , Vincent Lefevre
  • , Nicolas Louvet
  • , Jean-Michel Muller
  • Ecole Normale Supérieure de Lyon

Publikation: Kapitel i bog/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review

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.
OriginalsprogEngelsk
Titel19th IEEE Symposium onComputer Arithmetic, 2009. ARITH 2009.
ForlagIEEE
Publikationsdato2009
Sider155-160
StatusUdgivet - 2009
BegivenhedIEEE Symposium on Computer Arithmetic - IEEE Computer Society, USA
Varighed: 8. jun. 2009 → 10. jun. 2009
Konferencens nummer: 19

Konference

KonferenceIEEE Symposium on Computer Arithmetic
Nummer19
Land/OmrådeUSA
ByIEEE Computer Society
Periode08/06/2009 → 10/06/2009

Fingeraftryk

Dyk ned i forskningsemnerne om 'On the computation of correctly-rounded sums'. Sammen danner de et unikt fingeraftryk.

Citationsformater