ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
A comparison of floating point summation methods
Full text PdfPdf (83 KB)
Source
Communications of the ACM archive
Volume 15 ,  Issue 9  (September 1972) table of contents
Page: 838  
Year of Publication: 1972
ISSN:0001-0782
Author
James Gregory  Argonne National Lab, Argonne, IL
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 18,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/361573.361584
What is a DOI?

ABSTRACT

In the June 1970 issue of Communications, Linz [1] proposed a method of pairwise summing of numbers to reduce accumulated roundoff error. Linz compared his method with only a simple recursive summation. The Linz method should have also been compared with a method published in the January 1965 issue by Kahan [2], which is more accurate. This note compares the schemes by Linz and Kahan with the straight recursive summation. Comparisons of accuracy, speed and storage were carried out on an IBM 360/75 with various compiler optimization levels. (Linz' restriction to a binary exponent is not essential to his method.)


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
Peter Linz, Accurate floating-point summation, Communications of the ACM, v.13 n.6, p.361-362, June 1970  [doi>10.1145/362384.362498]
2
W. Kahan, Pracniques: further remarks on reducing truncation errors, Communications of the ACM, v.8 n.1, p.40, Jan. 1965  [doi>10.1145/363707.363723]

CITED BY
T. G. Robertazzi , S. C. Schwartz, Best “ordering” for floating-point addition, ACM Transactions on Mathematical Software (TOMS), v.14 n.1, p.101-110, March 1988

INDEX TERMS

Keywords:
error propagation, floating-point addition, summation, truncation error

Collaborative Colleagues:
James Gregory: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player