Compensated Horner algorithm in K times the working precision

Philippe Langlois 1 Nicolas Louvet 2
2 ARENAIRE - Computer arithmetic
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : We introduce an algorithm to evaluate a polynomial with floating point coefficients as accurately as the Horner scheme performed in K times the working precision, for K an arbitrary integer. The principle is to iterate the error-free transformation of the compensated Horner algorithm and to accurately sum the final decomposition. We prove this accuracy property with an apriori error analysis. We illustrate its practical efficiency with numerical experiments on significant environments and IEEE-754 arithmetic. Comparing to existing alternatives we conclude that this K-times compensated algorithm is competitive for K up to 4, i.e. up to 212 mantissa bits.
Document type :
Complete list of metadatas

Cited literature [2 references]  Display  Hide  Download
Contributor : Nicolas Louvet <>
Submitted on : Wednesday, March 26, 2008 - 2:08:06 PM
Last modification on : Thursday, February 7, 2019 - 4:20:18 PM
Long-term archiving on : Friday, September 28, 2012 - 11:45:15 AM


Files produced by the author(s)


  • HAL Id : inria-00267077, version 1



Philippe Langlois, Nicolas Louvet. Compensated Horner algorithm in K times the working precision. [Research Report] 2008. ⟨inria-00267077⟩



Record views


Files downloads