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

Transcribed Image Text:

3.2. The degree-n Chebyshev polynomial is defined by T₁(x) = cos [n cos¯¹(x)], −1≤x≤1. These satisfy To(x) = 1, T₁(x) = x, and the recursion relation In+1(x) = 2x Tn (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 [n cos¯¹(x)], −1≤x≤1. These satisfy To(x) = 1, T₁(x) = x, and the recursion relation In+1(x) = 2x Tn (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.

Answer rating: 100% (QA)

you can change x and N according to your requirement x 11rand101 1 random numbers between Ab ... View the full answer