Skip to main content
Log in

A Generalized Kahan-Babuška-Summation-Algorithm

  • Published:
Computing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • I. Babuška (1969) ArticleTitleNumerical stability in mathematical analysis Inf. Proc. 68 11–23

    Google Scholar 

  • O. Caprani (1971) ArticleTitleImplementation of a low round-off summation method BIT 11 271–275 Occurrence Handle10.1007/BF01931808 Occurrence Handle0229.65044

    Article  MATH  Google Scholar 

  • T. J. Dekker (1971) ArticleTitleA floating-point technique for extending the available precision Numer. Math. 18 224–242 Occurrence Handle10.1007/BF01397083 Occurrence Handle0226.65034 Occurrence Handle45 #8056

    Article  MATH  MathSciNet  Google Scholar 

  • D. Goldberg (1991) ArticleTitleWhat every computer scientist should know about floating-point arithmetic ACM Comput. Surv. 23 IssueID1 5–48 Occurrence Handle10.1145/103162.103163

    Article  Google Scholar 

  • N. J. Higham (1993) ArticleTitleThe accuracy of floating point summation SIAM J. Sci. Comput. 14 IssueID4 783–799 Occurrence Handle10.1137/0914050 Occurrence Handle0788.65053 Occurrence Handle94a:65025

    Article  MATH  MathSciNet  Google Scholar 

  • R. W. Hockney C. R. Jesshope (1981) Parallel computers: architecture, programming and algorithms Adam Hilger Bristol

    Google Scholar 

  • W. Kahan (1965) ArticleTitleFurther remarks on reducing trunctation errors Commun. ACM 8 40 Occurrence Handle10.1145/363707.363723

    Article  Google Scholar 

  • M.-Y. Kao J. Wang (2000) ArticleTitleLinear-time approximation algorithms for computing numerical summation with provably small errors SIAM J. Comput. 29 IssueID5 1568–1576 Occurrence Handle10.1137/S0097539798341594 Occurrence Handle2001j:65078

    Article  MathSciNet  Google Scholar 

  • Knuth, D. E.: The art of computer programming, vol 2. Seminumerical algorithms. Addison-Wesley 1968.

  • P. Linz (1970) ArticleTitleAccurate floating-point summation Commun. ACM 13 361–362 Occurrence Handle10.1145/362384.362498 Occurrence Handle0206.46102 Occurrence Handle44 #3468

    Article  MATH  MathSciNet  Google Scholar 

  • A. Neumaier (1974) ArticleTitleRundungsfehleranalyse einiger Verfahren zur Summation endlicher Summen ZAMM 54 39–51 Occurrence Handle0273.65032 Occurrence Handle51 #14556

    MATH  MathSciNet  Google Scholar 

  • Ogita, T., Rump, S. M., Oishi, S.: Accurate sum and dot products. SIAM 2005 (to appear).

  • J. H. Wilkinson (1960) ArticleTitleError analysis of floating-point computation Numer. Math. 2 319–340 Occurrence Handle10.1007/BF01386233 Occurrence Handle0091.29605 Occurrence Handle22 #7264

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. Klein.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Klein, A. A Generalized Kahan-Babuška-Summation-Algorithm. Computing 76, 279–293 (2006). https://doi.org/10.1007/s00607-005-0139-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-005-0139-x

AMS Subject Classifications

Keywords

Navigation