Chebyshev Polynomials

In mathematics the Chebyshev polynomials, named after Pafnuty Chebyshev (Пафнутий Чебышёв), are a sequence of orthogonal polynomials which are related to de Moivre's formula and which are easily defined recursively, like Fibonacci or Lucas numbers. One usually distinguishes between Chebyshev polynomials of the first kind which are denoted Tn and Chebyshev polynomials of the second kind which are denoted Un. The letter T is used because of the alternative transliterations of the name Chebyshev as Tchebyshef or Tschebyscheff. The Chebyshev polynomials Tn or Un are polynomials of degree n and the sequence of Chebyshev polynomials of either kind composes a polynomial sequence. Chebyshev polynomials are important in approximation theory because the roots of the Chebyshev polynomials of the first kind, which are also called Chebyshev nodes, are used as nodes in polynomial interpolation. The resulting interpolation polynomial minimizes the problem of Runge's phenomenon and provides the best approximation to a continuous function under the maximum norm. In the study of differential equations they arise as the solution to the Chebyshev differential equation
(1-x^2)\,y - x\,y' + n^2\,y = 0 \mbox{ and } (1-x^2)\,y - 3x\,y' + n(n+2)\,y = 0
for the polynomials of the first and second kind, respectively. These equations are special cases of the Sturm-Liouville differential equation.

Definition

The Chebyshev polynomials of the first kind are defined by the recurrence relation
T_0(x) = 1 \,
T_1(x) = x \,
T_{n+1}(x) = 2xT_n(x) - T_{n-1}(x). \,
One example of a generating function for this recurrence relation is
\sum_{n=0}^{\infty}T_n(x) t^n = \frac{1-tx}{1-2tx+t^2}.
The Chebyshev polynomials of the second kind are defined by the recurrence relation
U_0(x) = 1 \,
U_1(x) = 2x \,
U_{n+1}(x) = 2xU_n(x) - U_{n-1}(x). \,
One example of a generating function for this recurrence relation is
\sum_{n=0}^{\infty}U_n(x) t^n = \frac{1}{1-2tx+t^2}.

Trigonometric definition

The Chebyshev polynomials of the first kind can be defined by the trigonometric identity
T_n(\cos(\theta))=\cos(n\theta) \,
for n = 0, 1, 2, 3, .... . That cos(nx) is an nth-degree polynomial in cos(x) can be seen by observing that cos(nx) is the real part of one side of De Moivre's formula, and the real part of the other side is a polynomial in cos(x) and sin(x), in which all powers of sin(x) are even and thus replaceable via the identity cos²(x) + sin²(x) = 1. Written explicitly
T_n(x) =
\left\{ \begin{matrix} & \cos(n\arccos(x)) & \mbox{ , } \ x \in -1,1 \\ & \cosh(n \, \mathrm{arcosh}(x)) & \mbox{ , } \ x \ge 1 \\ & (-1)^n \cosh(n \, \mathrm{arcosh}(-x)) & \mbox{ , } \ x \le -1 \\ \end{matrix}\right. Similarly, the polynomials of the second kind satisfy
U_n(\cos(\theta)) = \frac{\sin((n+1)\theta)}{\sin\theta}.

Orthogonality

Both the Tn and the Un form a sequence of orthogonal polynomials. The polynomials of the first kind are orthogonal with respect to the weight
\frac{1}{\sqrt{1-x^2}},
on the interval −1,1, i.e. we have:
\int_{-1}^1 T_n(x)T_m(x)\,\frac{dx}{\sqrt{1-x^2}}=\left\{
\begin{matrix} 0 &: n\ne m~~~~~\\ \pi &: n=m=0\\ \pi/2 &: n=m\ne 0 \end{matrix} \right. This can be proven by letting x= cos(θ) and using the identity Tn (cos(θ))=cos(nθ). Similarly, the polynomials of the second kind are orthogonal with respect to the weight
\sqrt{1-x^2}
on the interval −1,1, i.e. we have:
\int_{-1}^1 U_n(x)U_m(x)\sqrt{1-x^2}\,dx=\left\{
\begin{matrix} 0 &: n\ne m\\ \pi/2 &: n=m \end{matrix} \right. (which, when normalized to form a probability measure, is the Wigner semicircle distribution).

Other properties

The Chebyshev polynomials of the first and second kind are closely related by the following equations
\frac{d}{dx} \, T_n(x) = n U_{n-1}(x) \mbox{ , } n=1,\ldots
T_n(x) = U_n(x) - x \, U_{n-1}(x).
The Chebyshev polynomials are a special case of the ultraspherical or Gegenbauer polynomials, which themselves are a special case of the Jacobi polynomials.

Examples

The first few Chebyshev polynomials of the first kind are
T_0(x) = 1 \,
T_1(x) = x \,
T_2(x) = 2x^2 - 1 \,
T_3(x) = 4x^3 - 3x \,
T_4(x) = 8x^4 - 8x^2 + 1 \,
T_5(x) = 16x^5 - 20x^3 + 5x \,
T_6(x) = 32x^6 - 48x^4 + 18x^2 - 1 \,
T_7(x) = 64x^7 - 112x^5 + 56x^3 - 7x \,
T_8(x) = 128x^8 - 256x^6 + 160x^4 - 32x^2 + 1 \,
T_9(x) = 256x^9 - 576x^7 + 432x^5 - 120x^3 + 9x. \,
The first few Chebyshev polynomials of the second kind are
U_0(x) = 1 \,
U_1(x) = 2x \,
U_2(x) = 4x^2 - 1 \,
U_3(x) = 8x^3 - 4x \,
U_4(x) = 16x^4 - 12x^2 + 1 \,
U_5(x) = 32x^5 - 32x^3 + 6x \,
U_6(x) = 64x^6 - 80x^4 + 24x^2 - 1. \,

Polynomial in Chebyshev form

A polynomial of degree N in Chebyshev form is a polynomial p(x) of the form
p(x) = \sum_{n=0}^{N} a_n T_n(x)
where Tn is the nth Chebyshev polynomial. Polynomials in Chebyshev form can be evaluated using the Clenshaw algorithm.

Chebyshev roots

A Chebyshev polynomial of either kind with degree n has n different simple roots, called Chebyshev roots, in the interval -1,1. The roots are sometimes called Chebyshev nodes because they are used as nodes in polynomial interpolation. Using the trigonometric form one can easily prove that the roots of Tn are
x_i = \cos\left(\frac{2i-1}{2n}\pi\right) \mbox{ , } i=1,\ldots,n.
Similarly, the roots of Un are
x_i = \cos\left(\frac{i}{n+1}\pi\right) \mbox{ , } i=1,\ldots,n.

See also

References

 

<< PreviousWord BrowserNext >>
1907 isle of man tt
eq
david h. bailey
fifi d'orsay
florence la badie
marie prevost
sunderland a.f.c.
braunau am inn
sam de grasse
joe de grasse
berton churchill
intentionality
sadducee
national organization for the reform of marijuana laws
unna (district)
charles christie
biefeld brown effect
wonders of the invisible world
jacob frank
valdemar i of denmark
bay of pigs invasion
ensemble
ralph hartley
pulitzer prize for general non fiction
danny carey
armenian numerals
gamma aminobutyric acid
list of people by occupation
samuel hahnemann
list of actors
list of tennis players
microbotics
cartoonist
sbus
lignum vitae
orgy (band)
pic microcontroller
gros morne national park
list of anti heroes
leapfrog
slacker
radford university
aho corasick algorithm
css grampus