Usuario:Heimy/Polinomios de Chebyshev

Usuario:Heimy/Polinomios de Chebyshev
En matemtica se conoce como polinomios de Chebyshev, en honor a Pafnuty Chebyshev, a una sucesin de polinomios ortogonales que estn relacionados a la frmula de De Moivre y que se definen recursivamente con sencillez, como los nmeros de Fibonacci o los de Lucas. Normalmente se distingue entre los polinomios de Chebyshev de primer tipo que se indica como Tn y los polinomios de Chebyshev de segundo tipo que se indican mediante Un. Se usa la letra T debido a las transliteraciones alternativas del nombre de Chebyshev como Tchebyshef o Tschebyscheff. Los polinomios de Chebyshev Tn o Un son de grado n y la sucesin de los plinomios de de Chebyshev de cualquier tipo compone una sucesin polinmica. Los polinomios de Chebyshev son importantes en la teora de la aproximacin porque las races de los polinomios de primer tipo, tambin llamadas nodos de Chebyshev, se usan como nodos en la interpolacin polinmica. La interpolacin polinmica resultante minimiza el problema del fenmeno de Runge y se acerca al polinomio de mejor aproximacin de una funcin continua bajo la norma uniforme. Esta aproximacin lleva directamente al mtodo de la cuadratura de Clenshaw-Curtis. En el estudio de ecuaciones diferenciales surgen como solucin a las ecuaciones diferenciales de Chebyshev

and

para los polinomios de primer y segundo tipo, respectivamente. Estas ecuaciones son casos especiales de la ecuacin diferencial de Sturm-Liouville.

Definicin
Los polinomios de Chebyshev del primer tipo se definen mediante la relacin de recurrencia

Un ejemplo de funcin generatriz de Tn es

Los polinomios de Chebyshev de segundo tipo se definen mediante la relacin de recurrencia

Un ejemplo de funcin generatriz de Un es

Usuario:Heimy/Polinomios de Chebyshev

Definicin trigonomtrica
Los polinomios de Chebyshev de primer tipo se pueden definir mediante la identidad trigonomtrica:

donde:

para n = 0, 1, 2, 3, ..., mientras que los polinomios de segundo tipo satisfacen:

que es estructuralmente bastante similar al ncleo de Dirichlet. 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. This identity is extremely useful in conjunction with the recursive generating formula inasmuch as it enables one to calculate the cosine of any integral multiple of an angle solely in terms of the cosine of the base angle. Evaluating the first two Chebyshev polynomials:

and:

one can straightforwardly determine that:

and so forth. To trivially check whether the results seem reasonable, sum the coefficients on both sides of the equals sign (that is, setting theta equal to zero, for which the cosine is unity), and one sees that 1 = 2 - 1 in the former expression and 1 = 4 - 3 in the latter. An immediate corollary is the composition identity (or the "nesting property")

Written explicitly

(not forgetting that the inverse hyperbolic cosines of x and x differ by the constant ). From reasoning similar to that above, one can develop a closed-form generating formula for Chebyshev polynomials of the first kind:

which, combined with DeMoivre's formula:

yields:

which, of course, is far more expedient for determining the cosine of N times a given angle than is cranking through almost N rounds of the recursive generator calculation. Finally, if we replace with x, we can alternatively

Usuario:Heimy/Polinomios de Chebyshev write:

Mutual recurrence
Equivalently, the two sequences can also be defined at once from a pair of mutual recurrence equations:

These can be derived from the trigonometric formulae; for example, if

, then

(Both these equations and the trigonometric equations take a simpler form if we, like some works, follow the alternate convention of denoting our (the polynomial of degree n) with instead.)

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

on the interval [1,1], i.e. we have:

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

on the interval [1,1], i.e. we have:

(which, when normalized to form a probability measure, is the Wigner semicircle distribution).

Usuario:Heimy/Polinomios de Chebyshev

Minimal
For any given

-norm
, among the polynomials of degree with leading coefficient 1, is

the one of which the maximal absolute value on the interval and points of . reaches this maximum exactly times: in

is minimal. This maximal absolute value is and and the other extremal

Relation between Chebyshev polynomials of the first and second kind

The Chebyshev polynomials of the first and second kind are closely related by the following equations

The recurrence relationship of the derivative of Chebyshev polynomials can be derived from these relations

This relationship is used in the Chebyshev spectral method of solving differential equations.

Other properties
The Chebyshev polynomials are a special case of the ultraspherical or Gegenbauer polynomials, which themselves are a special case of the Jacobi polynomials. For every nonnegative integer , and are both polynomials of degree . They are even or odd

functions of as is even or odd, so when written as polynomials of resp. The leading coefficient of is if , but if .

, it only has even or odd degree terms

Usuario:Heimy/Polinomios de Chebyshev

Examples
The first few Chebyshev polynomials of the first kind are

This image shows the first few Chebyshev polynomials of the first kind in the domain 1<x<1, 1<y<1; the flat T0, and T1, T2, T3, T4 and T5.

The first few Chebyshev polynomials of the second kind are

Polynomial in Chebyshev form

A polynomial of degree N in Chebyshev form is a polynomial p(x) of the form

This image shows the first few Chebyshev polynomials of the second kind in the domain 1<x<1, 1<y<1; the flat U0, and U1, U2, U3, U4 and U5. Although not visible in the image, Un(1)=n+1 and Un(1)=(n+1)(1)n.

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 definition and the fact that

one can easily prove that the roots of Tn are

Usuario:Heimy/Polinomios de Chebyshev

Similarly, the roots of Un are

Spread polynomials
The spread polynomials are in a sense equivalent to the Chebyshev polynomials of the first kind, but enable one to avoid square roots and conventional trigonometric functions in certain contexts, notably in rational trigonometry.

See also
Chebyshev nodes Chebyshev filter Chebyshev cube root Legendre polynomials Hermite polynomials

Chebyshev rational functions Clenshaw-Curtis quadrature approximation theory

References
Plantilla:Abramowitz Stegun ref

Fuentes y contribuyentes del artculo

Fuentes y contribuyentes del artculo

Usuario:Heimy/Polinomios de Chebyshev Fuente: http://es.wikipedia.org/w/index.php?oldid=23239532 Contribuyentes: Heimy, Magister Mathematicae, Rosarinagazo, 1 ediciones annimas

Fuentes de imagen, Licencias y contribuyentes

image:chebyshev.png Fuente: http://es.wikipedia.org/w/index.php?title=Archivo:Chebyshev.png Licencia: GNU General Public License Contribuyentes: Darapti, Maksim image:chebyshev2.png Fuente: http://es.wikipedia.org/w/index.php?title=Archivo:Chebyshev2.png Licencia: GNU General Public License Contribuyentes: Darapti, Maksim

Licencia
Creative Commons Attribution-Share Alike 3.0 Unported //creativecommons.org/licenses/by-sa/3.0/