3.2. The degree-n Chebyshev polynomial is defined by T (x)cos[ncos (x)], -1...

Transcribed Image Text:

3.2. The degree-n Chebyshev polynomial is defined by T (x)cos[ncos (x)], -1<x< 1 These satisfy To(x) 1, T1 (x) x, and the recursion relation Tn+1(x)2xTn (x)-Tn-1(x), n 1. Write a function chebeval (x, N) that evaluates all of the Chebyshev polynomials of degree less than or equal to N at all of the points in column vector x. The result should be an array of size length (x) by N+1 3.2. The degree-n Chebyshev polynomial is defined by T (x)cos[ncos (x)], -1<x< 1 These satisfy To(x) 1, T1 (x) x, and the recursion relation Tn+1(x)2xTn (x)-Tn-1(x), n 1. Write a function chebeval (x, N) that evaluates all of the Chebyshev polynomials of degree less than or equal to N at all of the points in column vector x. The result should be an array of size length (x) by N+1