Science Fair Project Encyclopedia
Clenshaw algorithm
In the mathematical subfield of numerical analysis the Clenshaw algorithm is a recursive method to evaluate polynomials in Chebyshev form.
Polynomial in Chebyshev form
A polynomial of degree N in Chebyshev form is a polynomial p(x) of the form
where Tn is the nth Chebyshev polynomial.
Clenshaw algorithm
The Clenshaw algorithm can be used to evaluate a polynomial in the Chebyshev form. Given
we define
|
|
|
|
|
|
|
|
then
See also
- Horner scheme to evaluate polynomials in monomial form
- De Casteljau's algorithm to evaluate polynomials in Bézier form
Last updated: 10-18-2005 16:23:24
03-10-2013 05:06:04
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details


