An Algorithm for Floating-point Accumulation of Sums with Small Relative Error By
نویسندگان
چکیده
Reproduction in whole or in part is permitted for any purpose of the United States Government.
منابع مشابه
Fixed-point FPGA Implementation of a Kalman Filter for Range and Velocity Estimation of Moving Targets
Tracking filters are extensively used within object tracking systems in order to provide consecutive smooth estimations of position and velocity of the object with minimum error. Namely, Kalman filter and its numerous variants are widely known as simple yet effective linear tracking filters in many diverse applications. In this paper, an effective method is proposed for designing and implementa...
متن کاملAccurate Floating Point Arithmetic through Hardware Error-Free Transformations
This paper presents a hardware approach to performing accurate floating point addition and multiplication using the idea of errorfree transformations. Specialized iterative algorithms are implemented for computing arbitrarily accurate sums and dot products. The results of a Xilinx Virtex 6 implementation are given, area and performance are compared against standard floating point units and it i...
متن کاملNumerical reproducibility for the parallel reduction on multi- and many-core architectures
Onmodern multi-core, many-core, and heterogeneous architectures, floating-point computations, especially reductions, may become non-deterministic and, therefore, non-reproducible mainly due to the non-associativity of floating-point operations. We introduce an approach to compute the correctly rounded sums of large floating-point vectors accurately and efficiently, achieving deterministic resul...
متن کاملA New Floating Point Arithmetic with Error Tracking Capability
A new modeless floating-point arithmetic called the precision arithmetic is developed to track, limit, and reject the accumulation of calculation errors during floating point calculations, by reinterpreting the polymorphic representation of the conventional floating point arithmetic. The validity of this strategy is demonstrated by tracking the calculation errors and by rejecting the meaningles...
متن کاملNew Algorithms for Efficient Taylor Model Operations including Arbitrary Precision
Within the framework of Taylor Model implementations, the multiplication of Taylor models is the most time intensive operation, and thus benefits most from performance improvements. We note that in the mulplication, every coefficient is utilized repeatedly in various products, and so it is possible to do limited pre-processing of the coefficients without performance penalty due to the preproces...
متن کامل