ACM

Communications of the ACM

Home/Magazine Archive/November 1972 (Vol. 15, No. 11)/Algorithms to reveal properties of floating-point.../Abstract

Algorithms to reveal properties of floating-point arithmetic

By Michael A. Malcolm
Communications of the ACM, November 1972, Vol. 15 No. 11, Pages 949-951
10.1145/355606.361870
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

Two algorithms are presented in the form of Fortran subroutines. Each subroutine computes the radix and number of digits of the floating-point numbers and whether rounding or chopping is done by the machine on which it is run. The methods are shown to work on any “reasonable” floating-point computer.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

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.