Issue No. 12 - Dec. (2017 vol. 66)
Vincent Lefevre , INRIA, LIP / CNRS / ENS Lyon / Université de Lyon, Lyon, France
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.
Context awareness, Floating-point arithmetic, Complexity theory, Open area test sites
V. Lefevre, "Correctly Rounded Arbitrary-Precision Floating-Point Summation," in IEEE Transactions on Computers, vol. 66, no. 12, pp. 2111-2124, 2017.