Chebyshev Polynomials - Definition

Definition

The Chebyshev polynomials of the first kind are defined by the recurrence relation

\begin{align} T_0(x) & = 1 \\ T_1(x) & = x \\ T_{n+1}(x) & = 2xT_n(x) - T_{n-1}(x). \end{align}

The conventional generating function for Tn is

The exponential generating function is

The generating function relevant for 2-dimensional potential theory and multipole expansion is

The Chebyshev polynomials of the second kind are defined by the recurrence relation

\begin{align} U_0(x) & = 1 \\ U_1(x) & = 2x \\ U_{n+1}(x) & = 2xU_n(x) - U_{n-1}(x). \end{align}

One example of a generating function for Un is

Read more about this topic:  Chebyshev Polynomials

Famous quotes containing the word definition:

    “I’m beginning to think that the proper definition of “Man” is “an animal that writes letters.””
    —Lewis Carroll [Charles Lutwidge Dodgson] (1832–1898)

    “Was man made stupid to see his own stupidity?
    Is God by definition indifferent, beyond us all?
    Is the eternal truth man’s fighting soul
    Wherein the Beast ravens in its own avidity?”
    —Richard Eberhart (b. 1904)

    “The man who knows governments most completely is he who troubles himself least about a definition which shall give their essence. Enjoying an intimate acquaintance with all their particularities in turn, he would naturally regard an abstract conception in which these were unified as a thing more misleading than enlightening.”
    —William James (1842–1910)