Algorithms to reveal properties of floating-point arithmetic

1 November 1972

journal article
Published by Association for Computing Machinery (ACM) in Communications of the ACM

Vol. 15 (11) , 949-951
https://doi.org/10.1145/355606.361870

Abstract

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.

Keywords

HIGH-LEVEL LANGUAGES
FLOATING-POINT ARITHMETIC
FLOATING-POINT NUMBER
PHILOSOPHY OF LANGUAGE DESIGN
FORTRAN SUBROUTINE
FLOATING-POINT COMPUTER
PROGRAMMING LANGUAGES
ALGORITHMS
HIGH LEVEL LANGUAGE
FLOATING POINT
FLOATING POINT ARITHMETIC
HIGH LEVEL LANGUAGES
COMPUTER PROGRAMMING
SUBROUTINES

This publication has 1 reference indexed in Scilit:

Environment enquiries (pages missing from print)
ACM SIGNUM Newsletter, 1971