Abstract
A forward rounding error analysis is presented for the extended Clenshaw algorithm due to Skrzipek for evaluating the derivatives of a polynomial expanded in terms of orthogonal polynomials. Reformulating in matrix notation the three-term recurrence relation satisfied by orthogonal polynomials facilitates the estimate of the rounding error for the m-th derivative, which is recursively estimated in terms of the one for the (m − 1)-th derivative. The rounding errors in an important case of Chebyshev polynomial are discussed in some detail.
Similar content being viewed by others
REFERENCES
P. Deuflhard, A summation technique for minimal solutions of linear homogeneous difference equations, Computing, 18 (1977), pp. 1–13.
D. Elliott, Error analysis of an algorithm for summing certain finite series, J. Austral. Math. Soc., 8(2) (1968), pp. 213–221.
G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
N. J. Higham, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, PA, 1996.
Y. L. Luke, Mathematical Functions and their Approximations, Academic Press, New York, 1975.
J. Oliver, An error analysis of the modified Clenshaw method for evaluating Chebyshev and Fourier series, J. Inst. Maths Applics, 20 (1977), pp. 379–391.
J. M. Peña and T. Sauer, On the multivariate Horner scheme, SIAM J. Numer. Anal., 37 (2000), pp. 1186–1197.
M. Skrzipek, Polynomial evaluation and associated polynomials, Numer. Math., 79 (1998), pp. 601–613.
J. Wimp, Computation with Recurrence Relations, Pitman, London, 1984.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hasegawa, T. Error Analysis of Clenshaw's Algorithm for Evaluating Derivatives of a Polynomial. BIT Numerical Mathematics 41, 1019–1028 (2001). https://doi.org/10.1023/A:1021993312929
Issue Date:
DOI: https://doi.org/10.1023/A:1021993312929