Correctly Rounded Arbitrary-Precision Floating-Point Summation - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Computers Year : 2017

Correctly Rounded Arbitrary-Precision Floating-Point Summation

Vincent Lefèvre

Abstract

We present a fast algorithm together with its low-level implementation of correctly rounded arbitrary-precision floating-point summation. The arithmetic is the one used by the GNU MPFR library: radix 2; no subnormals; each variable (each input and the output) has its own precision. We also give a worst-case complexity of this algorithm and describe how the implementation is tested.
Fichier principal
Vignette du fichier
ieeetc2017-mpfrsum-auth.pdf (275.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01394289 , version 1 (09-11-2016)
hal-01394289 , version 2 (10-04-2017)

Identifiers

Cite

Vincent Lefèvre. Correctly Rounded Arbitrary-Precision Floating-Point Summation. IEEE Transactions on Computers, 2017, 66 (12), pp.14. ⟨10.1109/TC.2017.2690632⟩. ⟨hal-01394289v2⟩
361 View
421 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More