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:

    “The definition of good prose is proper words in their proper places; of good verse, the most proper words in their proper places. The propriety is in either case relative. The words in prose ought to express the intended meaning, and no more; if they attract attention to themselves, it is, in general, a fault.”
    —Samuel Taylor Coleridge (1772–1834)

    “One definition of man is “an intelligence served by organs.””
    —Ralph Waldo Emerson (1803–1882)

    “According to our social pyramid, all men who feel displaced racially, culturally, and/or because of economic hardships will turn on those whom they feel they can order and humiliate, usually women, children, and animals—just as they have been ordered and humiliated by those privileged few who are in power. However, this definition does not explain why there are privileged men who behave this way toward women.”
    —Ana Castillo (b. 1953)