Recursion function-Chebyshev polynomials
www.mathworks.com › matlabcentral › answersSep 04, 2016 · Chebyshev polynomials are defined recursively. Chebyshev polynomials are separated into two kinds: first and second. Chebyshev polynomials of the first kind, Tn (x), and of the second kind, Un (x), are defined by the following recurrence relations: Write a function with header [y] = myChebyshevPoly1 (n,x), where y is the n-th Chebyshev ...
DLMF: 18.3 Definitions
dlmf.nist.gov › 18In this chapter, formulas for the Chebyshev polynomials of the second, third, and fourth kinds will not be given as extensively as those of the first kind. However, most of these formulas can be obtained by specialization of formulas for Jacobi polynomials, via (18.7.4)–(18.7.6).