Clenshaw algorithm

The Clenshaw algorithm is an algorithm of numerical mathematics, can be evaluated with the linear combinations of orthogonal polynomials such as the Chebyshev polynomials. This exploits that can calculate these polynomials recursively.

Algorithm

Let be a sequence of functions satisfying a three- term recursion:

Then can be calculated as follows:

193502
de