By R. J. Walker
Communications of the ACM,
June 1971,
Vol. 14 No. 6, Page 417
10.1145/362604.362617
Comments
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).
The full text of this article is premium content
No entries found
Log in to Read the Full Article
Need Access?
Please select one of the options below for access to premium content and features.
Create a Web Account
If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.
Join the ACM
Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.
Subscribe to Communications of the ACM Magazine
Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.
Purchase the Article
Non-members can purchase this article or a copy of the magazine in which it appears.
