The Chebyshev polynomials of T.(x) are defined recursively by: To (2) = 1 E Ti (z)==...

Transcribed Image Text:

The Chebyshev polynomials of T.(x) are defined recursively by: To (2) = 1 E Ti (z)== =2 T+1(x) = 2xTn (*) - Tn-1(x). To (x)=1 T₁(x)=x T₂(x)=2x²-1 T3 (x)=4x²-3x T₁(x)=8x²-8x² +1. Ts (x)=16x-20x³ + 5x To (x)=32x-48x + 18x²-1. 1. Write a recursive function val-chebyshev (n,x), where val is the nth Chebyshev polynomial evaluated at x. the function can take array inputs for x [ assume that x is a row vector]. The output variable, val, must be a row vector also. 2. Now plot the Cheybshev polynomial of order n in the interval -10,10 using the following: n = 4; t--10:0.01:10; plot (t, chebyshev (n, t)); The Chebyshev polynomials of T.(x) are defined recursively by: To (2) = 1 E Ti (z)== =2 T+1(x) = 2xTn (*) - Tn-1(x). To (x)=1 T₁(x)=x T₂(x)=2x²-1 T3 (x)=4x²-3x T₁(x)=8x²-8x² +1. Ts (x)=16x-20x³ + 5x To (x)=32x-48x + 18x²-1. 1. Write a recursive function val-chebyshev (n,x), where val is the nth Chebyshev polynomial evaluated at x. the function can take array inputs for x [ assume that x is a row vector]. The output variable, val, must be a row vector also. 2. Now plot the Cheybshev polynomial of order n in the interval -10,10 using the following: n = 4; t--10:0.01:10; plot (t, chebyshev (n, t));

Answer rating: 100% (QA)

The first part of the image defines the Chebyshev polynomials of Tnx recursivelyHeres the code for a Python function that implements this recursion Py... View the full answer