论文信息 - Correctly Rounded Arbitrary-Precision Floating-Point Summation

Correctly Rounded Arbitrary-Precision Floating-Point Summation

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 describe how the implementation is tested.

Vincent Lefèvre

[1] Vincent Lefèvre. Correctly Rounded Arbitrary-Precision Floating-Point Summation , 2017, IEEE Transactions on Computers.

[2] Ulrich W. Kulisch,et al. Advanced Arithmetic for the Digital Computer, Design of Arithmetic Units , 2002, RealComp.

[3] James Demmel,et al. Fast Reproducible Floating-Point Summation , 2013, 2013 IEEE 21st Symposium on Computer Arithmetic.

[4] James Demmel,et al. Fast and Accurate Floating Point Summation with Application to Computational Geometry , 2004, Numerical Algorithms.

[5] Siegfried M. Rump,et al. Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest , 2008, SIAM J. Sci. Comput..

[6] Vincent Lefèvre,et al. On the Computation of Correctly-Rounded Sums , 2009, 2009 19th IEEE Symposium on Computer Arithmetic.

[7] Vincent Lefèvre,et al. MPFR: A multiple-precision binary floating-point library with correct rounding , 2007, TOMS.

[8] James Demmel,et al. IEEE Standard for Floating-Point Arithmetic , 2008 .

[9] Siegfried M. Rump,et al. Ultimately Fast Accurate Summation , 2009, SIAM J. Sci. Comput..

[10] Jean-Michel Muller,et al. Handbook of Floating-Point Arithmetic (2nd Ed.) , 2018 .