Table-driven implementation of the logarithm function in IEEE floating-point arithmetic
ACM Transactions on Mathematical Software (TOMS)
Fast evaluation of elementary mathematical functions with correctly rounded last bit
ACM Transactions on Mathematical Software (TOMS)
Table-driven implementation of the Expm1 function in IEEE floating-point arithmetic
ACM Transactions on Mathematical Software (TOMS)
Table-driven implementation of the exponential function in IEEE floating-point arithmetic
ACM Transactions on Mathematical Software (TOMS)
Scientific Computing with Automatic Result Verification
Scientific Computing with Automatic Result Verification
Pascal-XSC: Language Reference with Examples
Pascal-XSC: Language Reference with Examples
C-XSC: A C++ Class Library for Extended Scientific Computing
C-XSC: A C++ Class Library for Extended Scientific Computing
Exact Computation of a Sum or Difference with Applications to Argument Reduction
ARITH '95 Proceedings of the 12th Symposium on Computer Arithmetic
A Family of Variable-Precision Interval Arithmetic Processors
IEEE Transactions on Computers
A Survey of Exact Arithmetic Implementations
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Proceedings of the 40th annual Design Automation Conference
Fast, Accurate Static Analysis for Fixed-Point Finite-Precision Effects in DSP Designs
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Tradeoff between Approximation Accuracy and Complexity for Range Analysis using Affine Arithmetic
Journal of Signal Processing Systems
Dynamic floating-point cancellation detection
Parallel Computing
Automatically adapting programs for mixed-precision floating-point computation
Proceedings of the 27th international ACM conference on International conference on supercomputing
Computation of the monodromy matrix in floating point arithmetic with the Wilkinson Model
Computers & Mathematics with Applications
| Hi-index | 14.98 |
A new technique for the a priori calculation of rigorous error bounds for floating-point computations is introduced. The theorems given in the paper combined with interval arithmetic lead to the implementation of reliable software routines, which enable the user to compute the desired error bounds automatically by a suitable computer program. As a prominent example, a table-lookup algorithm for calculating the function exp(x) $-$ 1 that has been published by Tang [16] is analyzed using these new tools. The result shows the high quality of the new approach.