A simple test qualifying the accuracy of Horner's rule for polynomials

Abstract : Polynomials are used in many applications and hidden in libraries such as libm. Whereas the accuracy of the functions used by linear algebra have long been studied, little is available to decide on one scheme to evaluate a polynomial. Common knowledge solely emphasizes that Horner's rule is a good scheme unless the indeterminate is close to one of the polynomial's roots. We propose here a criterion for one step of Horner's scheme to be faithful. A result is defined to be faithful when it was correctly rounded whereas the rounding mode (up, down or to the nearest) cannot be known by the user. Our criterion is checked against the IEEE standard for floating point arithmetic using the Coq automatic proof checker. We then present three programs in Maple, Java and C that check the criterion for a whole polynomial associated with a domain for the indeterminate and a possible truncation error. An example of use is given with the approximation of elementary functions.
Document type :
Reports
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02102015
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:12:02 AM
Last modification on : Sunday, May 5, 2019 - 1:24:47 AM

File

RR2003-01.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102015, version 1

Collections

Citation

Sylvie Boldo, Marc Daumas. A simple test qualifying the accuracy of Horner's rule for polynomials. [Research Report] LIP RR-2003-01, Laboratoire de l'informatique du parallélisme. 2003, 2+39p. ⟨hal-02102015⟩

Share

Metrics

Record views

10

Files downloads

40