Communications of the ACM,
Vol. 15 No. 9, Page 838
10.1145/361573.361584
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.)
The full text of this article is premium content
0 Comments
No entries found
Log in to Read the Full Article
Purchase the Article
Log in
Create a Web Account
If you are an ACM member, Communications subscriber, Digital Library subscriber, or use your institution's subscription, please set up a web account to access premium content and site
features. If you are a SIG member or member of the general public, you may set up a web account to comment on free articles and sign up for email alerts.