Write a computer module call Cheb(n,x) for evaluating T,(r). Use the recursion formula Tk+1(x) = 2xTk(r)...

Transcribed Image Text:

Write a computer module call Cheb(n,x) for evaluating T,(r). Use the recursion formula Tk+1(x) = 2xTk(r) - Tk-1(1), k≥ 1, To(x) = 1, T₁(x) = x. Test the program on these 15 cases: n = 0, 1,3,6, 12 and r = 0,-1,0.5. Question 2 Show that, for any natural number N, Σcos(o+ka) = k=0 sin (N+1) cos(+4) sin Write a computer module call Cheb(n,x) for evaluating T,(r). Use the recursion formula Tk+1(x) = 2xTk(r) - Tk-1(1), k≥ 1, To(x) = 1, T₁(x) = x. Test the program on these 15 cases: n = 0, 1,3,6, 12 and r = 0,-1,0.5. Question 2 Show that, for any natural number N, Σcos(o+ka) = k=0 sin (N+1) cos(+4) sin

Answer rating: 100% (QA)

Python code for the Chebyshev module is given below def Chebn x Evaluates the nth or... View the full answer