By T. E. Hull, J. R. Swenson
Communications of the ACM,
February 1966,
Vol. 9 No. 2, Pages 108-113
10.1145/365170.365212
Comments
In any prolonged computation it is generally assumed that the accumulated effect of roundoff errors is in some sense statistical.
The purpose of this paper is to give precise descriptions of certain probabilistic models for roundoff error, and then to describe a series of experiments for testing the validity of these models.
It is concluded that the models are in general very good. Discrepancies are both rare and mild.
The test techniques can also be used to experiment with various types of special arithmetic.
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.
