.png){kind=icon}
.png){kind=icon}
Return
Correctly Rounded Arbitrary-Precision Floating-Point Summation
.png){kind=icon}
OA
AI
DOI：10.1109/TC.2017.2690632.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Summation
floating point
arbitrary precision
multiple precision
correct rounding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K