Name
Abstract | ||
|---|---|---|
Running relative error for evaluating polynomials is analyzed and applied to different evaluation algorithms: Horner, VS, de Casteljau, and Clenshaw algorithms. Numerical experiments show that the derived running relative error bounds are sharp and that the de Casteljau algorithm presents better stability properties than the remaining algorithms. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1137/080745249 | SIAM J. Scientific Computing |
Keywords | Field | DocType |
numerical experiment,better stability property,relative error,de casteljau,remaining algorithm,clenshaw algorithm,relative error bound,different evaluation algorithm,conditioning | Condition number,Polynomial,Algorithm,De Casteljau's algorithm,Clenshaw algorithm,Numerical analysis,Numerical linear algebra,Mathematics,Numerical stability,Approximation error | Journal |
Volume | Issue | ISSN |
31 | 5 | 1064-8275 |
Citations | PageRank | References |
7 | 0.74 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Delgado | 1 | 107 | 17.39 |
| J. M. Peña | 2 | 681 | 72.88 |