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)[reply]

That would be nice —Preceding unsigned comment added by 76.165.224.41 (talk) 23:17, 24 April 2008 (UTC)[reply]

I can't follow this page - is a paragraph or equation missing? What do the $b_{n}$ actually relate to?

The last equation ( $p\left(x\right)=b_{0}$ ) can't be right

I would like to know:

Given polynomial, with coefficients $b_{n}$ :

$p\left(x\right)=\sum \limits _{n=0}^{N}b_{n}x^{n}$

how do we find the coefficients $a_{n}$ for the sum of Chebyshev polynomials

$p\left(x\right)=\sum \limits _{n=0}^{N}a_{n}T_{n}\left(x\right)$

- is that what it was meant to do?

If I find out I will come back and offer a fix --Robertpaynter (talk) 17:34, 28 October 2008 (UTC)[reply]