physicist
05-15-2008, 01:49 PM
Dear Moderator et al.,
For a number of special functions, especially when they are packaged
into larger programs with differentiation and/or integration routines, extended precision can simplify life for application programmers a lot .
Since version 4.2, gnu cc has implemented arbitrary precision modules
developed at INRIA and elsewhere. For FORTRAN it exists as a stand-alone
package by Miller for some time. This brings me to the question:
Does VNI/IMSL (in its FORTRAN implementation) plan to pursue
the following two developments?
Using ERF as a typical example, implement -for all relevant procedures-:
(a) ERF, DERF, QERF, OERF, HERF, ...
where Q=quadruple, O=octuple (8), H=hexadecuple (16) precision?
...
or
(b) Possibly in cooperation with FORTRAN-2008 committee, extend
the definition of KIND, with one additional (optional) parameter:
NB = the number of bits used for REAL, e.g. 64 ('standard')
128, 256, 512, 1024 ('extended'). The two other KIND parameters
are, as they are now, for the size of the mantisse and of exponent, respectively.
...
The reason for this proposal is: (i) arbitrary precision c-language constructs
may, at some time, pre-empt the market and (b) since computer
memory and processor speed has become much cheaper, FORTRAN precision construct, developed in 1956-1970 period, is 'out-of-date'.
However, ARBITRARY precision is for many numerical procedures
overdone and missing the essence of the problem. (*)
Therefore, a step-wise improvement of precision, increasing of the storage length of REALS by factors of two, would suffice.
With kind regards,
physicist
[A non-traditionalist would perhaps even propose real types based on
floating point numbers for x (normal), lx (log), llx (log-log), ex (exp),
eex (exp exp) respectively. However, this can have influence on the
type of algorithms that have been implemented. (As Dongarra has
written about LAPACK / SMP/ parallel in the book 'Beautiful Code'.)]
For a number of special functions, especially when they are packaged
into larger programs with differentiation and/or integration routines, extended precision can simplify life for application programmers a lot .
Since version 4.2, gnu cc has implemented arbitrary precision modules
developed at INRIA and elsewhere. For FORTRAN it exists as a stand-alone
package by Miller for some time. This brings me to the question:
Does VNI/IMSL (in its FORTRAN implementation) plan to pursue
the following two developments?
Using ERF as a typical example, implement -for all relevant procedures-:
(a) ERF, DERF, QERF, OERF, HERF, ...
where Q=quadruple, O=octuple (8), H=hexadecuple (16) precision?
...
or
(b) Possibly in cooperation with FORTRAN-2008 committee, extend
the definition of KIND, with one additional (optional) parameter:
NB = the number of bits used for REAL, e.g. 64 ('standard')
128, 256, 512, 1024 ('extended'). The two other KIND parameters
are, as they are now, for the size of the mantisse and of exponent, respectively.
...
The reason for this proposal is: (i) arbitrary precision c-language constructs
may, at some time, pre-empt the market and (b) since computer
memory and processor speed has become much cheaper, FORTRAN precision construct, developed in 1956-1970 period, is 'out-of-date'.
However, ARBITRARY precision is for many numerical procedures
overdone and missing the essence of the problem. (*)
Therefore, a step-wise improvement of precision, increasing of the storage length of REALS by factors of two, would suffice.
With kind regards,
physicist
[A non-traditionalist would perhaps even propose real types based on
floating point numbers for x (normal), lx (log), llx (log-log), ex (exp),
eex (exp exp) respectively. However, this can have influence on the
type of algorithms that have been implemented. (As Dongarra has
written about LAPACK / SMP/ parallel in the book 'Beautiful Code'.)]