Talk:Clenshaw algorithm

What about Chebyshev polynomials of the second kind? Can they be evaluated quickly?

Yes, they can be evaluated quickly, just replace $x$ with $2x$ in the expression for $b_{0}$. As a matter of fact, the Clenshaw algorithm is a general method for evaluation of a linear combination of functions that can be expressed using a recurrence formula. If you like, I will describe the general algorithm including the references to relevant literature. --Zdeněk Wagner (talk) 10:27, 23 November 2007 (UTC)

That would be nice