Fast High Precision Summation *

  title={Fast High Precision Summation *},
  author={Takeshi Ogita and Shin’ichi Oishi}
Given a vector p i of floating-point numbers with exact sum s, we present a new algorithm with the following property: Either the result is a faithful rounding of s, or otherwise the result has a relative error not larger than eps K cond (p i) for K to be specified. The statements are also true in the presence of underflow, the computing time does not depend on the exponent range, and no extra memory is required. Our algorithm is fast in terms of measured computing time because it allows good… CONTINUE READING


Publications citing this paper.
Showing 1-5 of 5 extracted citations

Parallel Reproducible Summation

IEEE Transactions on Computers • 2015
View 4 Excerpts
Highly Influenced

Fast Reproducible Floating-Point Summation

2013 IEEE 21st Symposium on Computer Arithmetic • 2013
View 8 Excerpts
Highly Influenced

Augmented Arithmetic Operations Proposed for IEEE-754 2018

2018 IEEE 25th Symposium on Computer Arithmetic (ARITH) • 2018
View 1 Excerpt

Parallel online exact sum for Java8

2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS) • 2016
View 1 Excerpt


Publications referenced by this paper.
Showing 1-3 of 3 references

A note on floating - point summation of very many terms

A. Smoktunowicz Jankowski, H. Woźniakowski
Accuracy and Stability of Numerical Algorithms • 2002

Similar Papers

Loading similar papers…