A Generalized Kahan-Babuška-Summation-Algorithm

@article{Klein2005AGK,
  title={A Generalized Kahan-Babu{\vs}ka-Summation-Algorithm},
  author={Andr{\'e} Klein},
  journal={Computing},
  year={2005},
  volume={76},
  pages={279-293}
}
In this article, we combine recursive summation techniques with Kahan-Babuška type balancing strategies [1], [7] to get highly accurate summation formulas. An i-th algorithm have only error beyond 1upl and thus allows to sum many millions of numbers with high accuracy. The additional afford is a small multiple of the naive summation. In addition we show that these algorithms could be modified to provide tight upper and lower bounds for use with interval arithmetic. 
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Parallel Computers: Architecture, Programming and Algorithms

  • R. W. Hockney, C. R. Jesshope
  • Adam Hilger, Bristol,
  • 1981
1 Excerpt

Rundungsfehleranalyse einiger Verfahren zur Summation endlicher Summen

  • A. Neumaier
  • Z. angew. Math. Mechanik,
  • 1974
2 Excerpts

A floating-point technique for extending the available precision

  • T. J. Dekker
  • Numer. Math.,
  • 1971
1 Excerpt

Implementation of a low round-off summation method

  • O. Caprani
  • BIT, 11:271–275,
  • 1971
1 Excerpt

Similar Papers

Loading similar papers…