Thumbnail
Access Restriction
Subscribed

Author Walker, R. J.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Round-off errors ♦ Floating-point addition ♦ Summation ♦ Binary summation
Abstract In discussing his binary summation method [1] Linz mentions two defects: “It is more difficult to program than the standard method, and it is difficult to use unless all numbers are available at the start of the summation.” A defect not mentioned is the extra storage space (approximately N words) required for the Sij. The last two of these three defects can be removed by proper combination of partial sums. In the adjacent PL/I program, the only storage needed is for the M-component vector T, where M ≧ [log2 N]. N must be even, and B is a number not expressible as a sum of A(I)'s, e.g. B = -1 if A(I) ≥ 0, or B = 1E + 75 for reasonably sized A(I).
Description Affiliation: Cornell Univ., Ithaca, NY (Walker, R. J.)
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 14
Issue Number 6
Page Count 2
Starting Page 417
Ending Page 418


Open content in new tab

   Open content in new tab
Source: ACM Digital Library