By splitting the mantissa of a multiple precision number into BLOCKS of constant width, it has been shown that the precision of a computer can be increased to a degree as high as we please by merely developing a FORTRAN program that can force the computer to perform all arithmetical executions up to any desired number of significant decimal places. Some of the salient features of such a programming are summarized as follows: 1 It reduces inherent errors arising due to approximate nature of representing in some finite number of digits a number that cannot ordinarily be represented exactly in the number of digits available with the particular installation being used. 2 The working of the computer proceeds just as if it were a decimal computer. Naturally we should expect better results even for the same number of digits as the computer normally takes. 3 It takes due care of very low/high numbers occurring in intermediate calculations as one word space is being provided to store the exponent itself. 4 Being problem oriented in nature, the FORTRAN language is most commonly understood by a large section of programmers. It is mainly for this reason that although it requires comparatively more time and space, one can save one's own valuable time in learning complicated assembly languages which differ from computer to computer. 5 It can be easily extended to complex numbers.
[1]
Seymour V. Pollack,et al.
A GUIDE TO FORTRAN IV
,
1965
.
[2]
M. Tienari,et al.
A set of procedures making real arithmetic of unlimited accuracy possible within ALGOL 60
,
1966
.
[3]
Yasuhiko Ikebe.
Note on triple-precision floating-point arithmetic with 132-bit numbers
,
1965,
CACM.
[4]
Daniel D. McCracken,et al.
Numerical methods with Fortran IV case studies
,
1967
.
[5]
George E. Collins.
PM, a system for polynomial manipulation
,
1966,
CACM.
[6]
Bruce I. Blum.
An extended arithmetic package
,
1965,
CACM.