Name
Abstract | ||
|---|---|---|
Abstract: Polynomials are used in many applications and hidden in libraries such aslibm. Whereas the accuracy of the functions used by linear algebra have longbeen studied, little is available to decide on one scheme to evaluate a polynomial.Common knowledge solely emphasizes that Horner's rule is a goodscheme unless the indeterminate is close to one of the polynomial's roots. Wepropose here a criterion for one step of Horner's scheme to be faithful. A resultis defined to be faithful when it was... |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1023/B:NUMA.0000049487.98618.61 | Numerical Algorithms |
Keywords | Field | DocType |
floating point,IEEE 754 standard,Horner's rule,formal proof,coq | Linear algebra,Truncation error,Mathematical optimization,Algebra,Polynomial,Floating point,Mathematical analysis,Elementary function,Rounding,Indeterminate,Mathematics,Formal proof | Journal |
Volume | Issue | ISSN |
37 | 1-4 | 1572-9265 |
Citations | PageRank | References |
4 | 0.69 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sylvie Boldo | 1 | 292 | 26.85 |
| Marc Daumas | 2 | 216 | 25.32 |