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 ...
We provide sufficient conditions that formally guarantee that the floating-point computation of a po...
AbstractThe problem of the evaluation in floating-point arithmetic of a polynomial with floating-poi...
The Floating-Point (FP) implementation of a real-valued function is performed with correct rounding ...
Polynomials are used in many applications and hidden in libraries such as libm. Whereas the accuracy...
(eng) Polynomials are used in many applications and hidden in libraries such as libm. Whereas the ac...
International audiencePolynomials are used in many applications and hidden in libraries such as libm...
International audiencePolynomials are used in many applications and hidden in libraries such as libm...
Using error-free transformations, we improve the classic Horner Scheme (HS) to evaluate (univariate)...
Using error-free transformations, we improve the classic Horner Scheme (HS) to evaluate (univariate)...
AbstractThe error propagation characteristics of the polynomial evaluation schemes of Horner, Clensh...
Polynomials are used in many applications and hidden in libraries such as libm. Whereas the accuracy...
International audienceSeveral different techniques and softwares intend to improve the accuracy of r...
Several different techniques and softwares intend to improve the accuracy of results computed in a f...
AbstractThe error propagation characteristics of the polynomial evaluation schemes of Horner, Clensh...
The Horner and Goertzel algorithms are frequently used in polynomial evaluation. Each of them can be...
We provide sufficient conditions that formally guarantee that the floating-point computation of a po...
AbstractThe problem of the evaluation in floating-point arithmetic of a polynomial with floating-poi...
The Floating-Point (FP) implementation of a real-valued function is performed with correct rounding ...
Polynomials are used in many applications and hidden in libraries such as libm. Whereas the accuracy...
(eng) Polynomials are used in many applications and hidden in libraries such as libm. Whereas the ac...
International audiencePolynomials are used in many applications and hidden in libraries such as libm...
International audiencePolynomials are used in many applications and hidden in libraries such as libm...
Using error-free transformations, we improve the classic Horner Scheme (HS) to evaluate (univariate)...
Using error-free transformations, we improve the classic Horner Scheme (HS) to evaluate (univariate)...
AbstractThe error propagation characteristics of the polynomial evaluation schemes of Horner, Clensh...
Polynomials are used in many applications and hidden in libraries such as libm. Whereas the accuracy...
International audienceSeveral different techniques and softwares intend to improve the accuracy of r...
Several different techniques and softwares intend to improve the accuracy of results computed in a f...
AbstractThe error propagation characteristics of the polynomial evaluation schemes of Horner, Clensh...
The Horner and Goertzel algorithms are frequently used in polynomial evaluation. Each of them can be...
We provide sufficient conditions that formally guarantee that the floating-point computation of a po...
AbstractThe problem of the evaluation in floating-point arithmetic of a polynomial with floating-poi...
The Floating-Point (FP) implementation of a real-valued function is performed with correct rounding ...