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 give a wo...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 2017-12, Vol.66 (12), p.2111-2124
Main Author: Lefevre, Vincent
Format: Article
Language:English
Subjects:
Algorithms
arbitrary precision
Complexity theory
Computer Arithmetic
Computer Science
Context awareness
correct rounding
floating point
Floating point arithmetic
multiple precision
Open area test sites
Summation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2017.2690632