1.

Which of the following represents the chebyshev recursive formula?(a) Tm(z) = 2zTm-1(z) – Tm-2(z)(b) Tm(z) = zTm-1(z) – 2Tm-2(z)(c) Tm(z) = 2Tm-1(z) – zTm-2(z)(d) Tm(z) = Tm-1(z) – 2zTm-2(z)The question was posed to me in an online interview.This intriguing question originated from Adaptive Array topic in section Phased, Adaptive and Binomial Arrays of Antennas

Answer»

Correct CHOICE is (a) Tm(z) = 2zTm-1(z) – Tm-2(z)

Best EXPLANATION: The Chebyshev POLYNOMIAL of any ORDER m can be derived from the recursive formula. This is ONE of the main features of the Chebyshev polynomial. It is given by

Tm(z) = 2zTm-1(z) – Tm-2(z).



Discussion

No Comment Found

Related InterviewSolutions