Faithful Polynomial Evaluation with Compensated Horner Algorithm - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Faithful Polynomial Evaluation with Compensated Horner Algorithm

Résumé

This paper presents two sufficient conditions to ensure a faithful evaluation of polynomial in IEEE-754 floating point arithmetic. Faithfulness means that the computed value is one of the two floating point neighbours of the exact result; it can be satisfied using a more accurate algorithm than the classic Horner scheme. One condition here provided is an apriori bound of the polynomial condition number derived from the error analysis of the compensated Horner algorithm. The second condition is both dynamic and validated to check at the running time the faithfulness of a given evaluation. Numerical experiments illustrate the behavior of these two conditions and that associated running time over-cost is really interesting.
Fichier principal
Vignette du fichier
LaLo06.pdf (391.5 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-00107222 , version 1 (20-10-2006)

Identifiants

Citer

Philippe Langlois, Nicolas Louvet. Faithful Polynomial Evaluation with Compensated Horner Algorithm. ARITH18: 18th IEEE International Symposium on Computer Arithmetic, Jun 2007, Montpellier, France. pp.141--149. ⟨hal-00107222⟩

Collections

UNIV-PERP
51 Consultations
556 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More