Sciweavers

Share
SAC
2006
ACM

Improving the compensated Horner scheme with a fused multiply and add

9 years 4 months ago
Improving the compensated Horner scheme with a fused multiply and add
Several different techniques and softwares intend to improve the accuracy of results computed in a fixed finite precision. Here we focus on a method to improve the accuracy of the polynomial evaluation. It is well known that the use of the Fused Multiply and Add operation available on some microprocessors like Intel Itanium improves slightly the accuracy of the Horner scheme. In this paper, we propose an accurate compensated Horner scheme specially designed to take advantage of the Fused Multiply and Add. We prove that the computed result is as accurate as if computed in twice the working precision. The algorithm we present is fast since it only requires well optimizable floating point operations, performed in the same working precision as the given data. Categories and Subject Descriptors G.4 [Mathematics of Computation]: Mathematical Software—Reliability and robustness; G.4 [Mathematics of Computation]: Mathematical Software—Efficiency General Terms Algorithms, Reliability, ...
Stef Graillat, Philippe Langlois, Nicolas Louvet
Added 14 Jun 2010
Updated 14 Jun 2010
Type Conference
Year 2006
Where SAC
Authors Stef Graillat, Philippe Langlois, Nicolas Louvet
Comments (0)
books