Accurate floating point summation∗


We present and analyze several simple algorithms for accurately summing n floating point numbers S = ∑n i=1 si, independent of how much cancellation occurs in the sum. Let f be the number of significant bits in the si. We assume a register is available with F > f significant bits. Then assuming that (1) n ≤ b2F−f/(1 − 2−f )c + 1, (2) rounding is to nearest… (More)


2 Figures and Tables

Cite this paper

@inproceedings{Demmel2002AccurateFP, title={Accurate floating point summation∗}, author={James Demmel and Yozo Hida}, year={2002} }