Accuracy and Stability of Numerical Algorithms, Second Edition

From 1946-1948 a great deal of quite detailed coding was done. The subroutines for floating-point arithmetic were ... produced by Alway and myself in 1947 ... They were almost certainly the earliest floating-point subroutines.
- J. H. WILKINSON. Turing's Work at the National Physical Laboratory ... (1980)
MATLAB's creator Cleve Moler used to advise foreign visitors not to miss the country's two most awesome spectacles: the Grand Canyon, and meetings of IEEE p754.
- MICHAEL L. OVERTON, Numerical Computing with IEEE Floating Point Arithmetic (2001)
Arithmetic on Cray computers is interesting because it is driven by a motivation for the highest possible floating-point performance ... Addition on Cray computers does not have a guard digit, and multiplication is even less accurate than addition ... At least Cray computers serve to keep numerical analysts on their toes!
- DAVID GOLDBERG [5], Computer Arithmetic (1996)
It is rather conventional to obtain a "realistic" estimate of the possible overall error due to k roundoffs, when k is fairly large, by replacing k by ?k in an expression for (or an estimate of) the maximum resultant error.
- F. B. HILDEBRAND, Introduction to Numerical Analysis (1974)
[5]In Hennessy and Patterson [562, 1996, A.12].
A floating point number system
is a subset of the real numbers whose elements have the form
The system F is characterized by four integer parameters:
the base ? (sometimes called the radix),