Thumbnail
Access Restriction
Subscribed

Author Gregory, James
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Floating-point addition ♦ Summation ♦ Error propagation ♦ Truncation error
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.)
Description Affiliation: Argonne National Lab, Argonne, IL (Gregory, James)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 15
Issue Number 9


Open content in new tab

   Open content in new tab
Source: ACM Digital Library