Running relative error for the evaluation of polynomials
J Delgado, JM Peña - SIAM Journal on Scientific Computing, 2009 - SIAM
J Delgado, JM Peña
SIAM Journal on Scientific Computing, 2009•SIAMRunning 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.
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.
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.
Society for Industrial and Applied MathematicsShowing the best result for this search. See all results