(Theoretical) The Chebyshev polynomials of the second kind\(U_n\) can be defined as follows: \(U_0(x) = 1\text{,}\)\(U_1(x) = 2x\text{,}\) and after that,
(This is the same recursive formula as for \(T_n\text{,}\) but it produces different polynomials because \(U_1\) is different from \(T_1\text{.}\)) Prove that
(Theoretical) Use (22.4.2) to prove that the Chebyshev extreme points \(x_k = \cos(\pi k/n)\) with \(k=1, \dots, n-1\) are the roots of polynomial \(U_{n-1}\text{.}\)
Suppose we want to draw a smooth parametric curve through 10 given points on xy-plane. The points are represented by vectors of their x- and y-coordinates:
The command plot(X, Y) can join these points by line segments, but that does not make a smooth curve. To obtain a smooth curve, adapt Example 22.3.2 as follows:
Your script should create two interpolating polynomials (px and py) on the interval \([-1, 1]\text{.}\) One is computed from the values X and the other from the values Y.