Chebyshev Polynomials

(redirected from Chebyshev polynomial)

Chebyshev polynomials

[′cheb·ə·shəf ‚päl·i′nō·mē·əlz]
(mathematics)
A family of orthogonal polynomials which solve Chebyshev's differential equation.

Chebyshev Polynomials

 

Chebyshev polynomials of the first kind are a special system of polynomials of successively increasing degree. For n = 0, 1, 2, . . . they are defined by the formula

In particular, T0 = 1, T1 = x, T2 = 2x2 – 1, T3 = 4x3 – 3x and T4 = 8x4 – 8x2 + 1.

The polynomials Tn (x) are orthogonal with respect to the weight function (1 – x2)–½ on the interval [–1, +1] (seeORTHOGONAL POLYNOMIALS). They satisfy the differential equation

(1 – x2)yxy + n2y = 0

and the recursion formula

Tn+1 (x) = 2xTn(x) – Tn – 1(x)

Chebyshev polynomials of the first kind are a special case of the Jacobi polynomials Pn(α,β)(x):

Chebyshev polynomials of the second kind Un (x) are a system of polynomials that are orthogonal with respect to the weight function (1 – x2)½ on the interval [–1, +1]. The relation between Chebyshev polynomials of the second kind and Chebyshev polynomials of the first kind is given by, for example, the recursion formula

(1 – x2)Un – 1 (x) = xTn (x) – Tn+l(x)

REFERENCES

Chebyshev, P. L. Poln. sobr. soch., vols. 2–3. Moscow-Leningrad, 1947–48.
Szegö, G. Ortogonal’nye mnogochleny. Moscow, 1962. (Translated from English.)
References in periodicals archive ?
Compared to RSA and ECC, Chebyshev polynomial computation problem offers smaller key sizes, faster computation, as well as memory, energy and bandwidth savings.
k](u) = cos (karccosu) is the kth Chebyshev polynomial of the first kind.
k] (x) in the above expression denotes a k degree Chebyshev polynomial of the first kind.
Fang, "Analysis of stochastic bifurcation and chaos in stochastic Duffing-van der Pol system via Chebyshev polynomial approximation," Chinese Physics, vol.
By exploiting the Trigonometric identity property of the Chebyshev polynomial, we developed a numerical scheme referred to as the spectral Galerkin method.
j=0] be the zeros of the Chebyshev polynomial of the first kind [T.
The Chebyshev polynomial is often used as a synthesis method of the filter design [12,13].
1] (x) is the l-th Chebyshev polynomial of the first kind.
Also these techniques are specific for shielded microstrip using Chebyshev polynomial as basis functions.
Chebyshev polynomial approximations for nonlinear differential initial value problems, Nonlinear Analysis TMA, vol.
Advanced VEC software processes the data in minutes with a special set of Chebyshev polynomial algorithms.
n] denote the Chebyshev polynomial for K such that all zeros of [[mu].