Chebyshev polynomials

Chebyshev polynomials

In mathematics the Chebyshev polynomials, named after Pafnuty Chebyshev,[1] are a sequence of orthogonal polynomials which are related to de Moivre's formula and which can be defined recursively. 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 Tchebycheff (French) or Tschebyschow (German).

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 an approximation that is close to the polynomial of best approximation to a continuous function under the maximum norm. This approximation leads directly to the method of Clenshaw–Curtis quadrature.

In the study of differential equations they arise as the solution to the Chebyshev differential equations

(1-x^2)\,y'' - x\,y' + n^2\,y = 0 \,\!


(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.



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).

The conventional generating function for Tn is

\sum_{n=0}^{\infty}T_n(x) t^n = \frac{1-tx}{1-2tx+t^2}. \,\!

The exponential generating function is

\sum_{n=0}^{\infty}T_n(x) \frac{t^n}{n!} = {1 \over 2}\left( e^{(x-\sqrt{x^2 -1})t}+e^{(x+\sqrt{x^2 -1})t}\right). \,\!

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 Un is

\sum_{n=0}^{\infty}U_n(x) t^n = \frac{1}{1-2 t x+t^2}. \,\!

Trigonometric definition

The Chebyshev polynomials of the first kind can be defined by the trigonometric identity:

T_n(x)=\cos(n \arccos x)=\cosh(n\,\mathrm{arccosh}\,x) \,\!


T_n(\cos(\vartheta))=\cos(n\vartheta) \,\!

for n = 0, 1, 2, 3, ..., while the polynomials of the second kind satisfy:

 U_n(\cos(\vartheta)) = \frac{\sin((n+1)\vartheta)}{\sin\vartheta} \,\!

which is structurally quite similar to the Dirichlet kernel D_n(x) \,\!:

 D_n(x) = \frac{\sin((2n+1)(x/2))}{\sin (x/2)} = U_{2n}(\cos (x/2))\,\!

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 cos2(x) + sin2(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:

T_0(x)=\cos\ 0x\ =1 \,\!


T_1(\cos(x))=\cos(x) \,\!

one can straightforwardly determine that:

\cos(2 \vartheta)=2\cos\vartheta \cos\vartheta - \cos(0 \vartheta) = 2\cos^{2}\,\vartheta - 1 \,\!

\cos(3 \vartheta)=2\cos\vartheta \cos(2\vartheta) - \cos\vartheta = 4\cos^3\,\vartheta - 3\cos\vartheta \,\!

and so forth.

Two immediate corollaries are the composition identity (or the "nesting property")

T_n(T_m(x)) = T_{nm}(x).\,\!

and the expression of complex exponentiation in terms of Chebyshev polynomials: given z = a + bi,

z^n & = |z|^n \left(\cos \left(n\arccos \frac a{|z|}\right) + i \sin \left(n\arccos \frac a{|z|}\right)\right) \\
& = |z|^n T_n\left(\frac a{|z|}\right) + ib\ |z|^{n - 1}\ U_{n-1}\left(\frac a{|z|}\right).

Pell equation definition

The Chebyshev polynomials can also be defined as the solutions to the Pell equation

T_n(x)^2 - (x^2-1) U_{n-1}(x)^2 = 1 \,\!

in a ring R[x].[2] Thus, they can be generated by the standard technique for Pell equations of taking powers of a fundamental solution:

T_n(x) + U_{n-1}(x) \sqrt{x^2-1} = (x + \sqrt{x^2-1})^n. \,\!

Relation between Chebyshev polynomials of the first and second kinds

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) = \frac{1}{2} (U_n(x) - \, U_{n-2}(x)).
T_{n+1}(x) = xT_n(x) - (1 - x^2)U_{n-1}(x)\,
T_n(x) = U_n(x) - x \, U_{n-1}(x),
 U_n(x) =2\sum_{j\,\, \text{odd}}^n T_j(x)  , where n is odd.
 U_n(x) =2\sum_{j\, \text{even}}^n T_j(x)-1  , where n is even.

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

2 T_n(x) = \frac{1}{n+1}\; \frac{d}{dx} T_{n+1}(x) - \frac{1}{n-1}\; \frac{d}{dx} T_{n-1}(x) \mbox{ , }\quad n=1,\ldots

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

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

T_0(x) = 1\,\!
U_{-1}(x) = 0\,\!
T_{n+1}(x) = xT_n(x) - (1 - x^2)U_{n-1}(x)\,
U_n(x) = xU_{n-1}(x) + T_n(x)\,

These can be derived from the trigonometric formulae; for example, if x = \cos\vartheta, then

 T_{n+1}(x) &= T_{n+1}(\cos(\vartheta)) \\
 &= \cos((n + 1)\vartheta) \\
 &= \cos(n\vartheta)\cos(\vartheta) - \sin(n\vartheta)\sin(\vartheta) \\
 &= T_n(\cos(\vartheta))\cos(\vartheta) - U_{n-1}(\cos(\vartheta))\sin^2(\vartheta) \\
 &= xT_n(x) - (1 - x^2)U_{n-1}(x). \\

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

Turán's inequalities for the Chebyshev polynomials are

T_n(x)^2-T_{n-1}(x) T_{n+1}(x)= 1-x^2>0 \text{ for } -1<x<1\! and
U_n(x)^2-U_{n-1}(x) U_{n+1}(x)= 1>0.\!

Explicit formulas

Different approaches to defining Chebyshev polynomials lead to different explicit formulas such as:

T_n(x) =
\cos(n\arccos(x)), & \ x \in [-1,1] \\
\cosh(n \, \mathrm{arccosh}(x)), & \ x \ge 1 \\
(-1)^n \cosh(n \, \mathrm{arccosh}(-x)), & \ x \le -1 \\
\end{cases} \,\!

T_n(x) & = \frac{(x-\sqrt{x^2-1})^n+(x+\sqrt{x^2-1})^n}{2} \\
& = \sum_{k=0}^{\lfloor n/2\rfloor} \binom{n}{2k} (x^2-1)^k x^{n-2k} \\
& = x^n \sum_{k=0}^{\lfloor n/2\rfloor} \binom{n}{2k} (1 - x^{-2})^k \\
& = \frac{n}{2}\sum_{k=0}^{\lfloor n/2\rfloor}(-1)^k \frac{(n-k-1)!}{k!(n-2k)!}~(2x)^{n-2k} \quad (n>0) \\
& = n \sum_{k=0}^{n}(-2)^{k} \frac{(n+k-1)!} {(n-k)!(2k)!}(1 - x)^k \quad (n>0)\\
& = \, _2F_1\left(-n,n;\frac 1 2; \frac{1-x} 2 \right) \\

U_n(x) & = \frac{(x+\sqrt{x^2-1})^{n+1} - (x-\sqrt{x^2-1})^{n+1}}{2\sqrt{x^2-1}} \\
& = \sum_{k=0}^{\lfloor n/2\rfloor} \binom{n+1}{2k+1} (x^2-1)^k x^{n-2k} \\
& = x^n \sum_{k=0}^{\lfloor n/2\rfloor} \binom{n+1}{2k+1} (1 - x^{-2})^k \\
& =\sum_{k=0}^{\lfloor n/2\rfloor} \binom{2k-(n+1)}{k}~(2x)^{n-2k} \quad (n>0)\\
& =\sum_{k=0}^{\lfloor n/2\rfloor}(-1)^k \binom{n-k}{k}~(2x)^{n-2k} \quad (n>0)\\
& = \sum_{k=0}^{n}(-2)^{k} \frac{(n+k+1)!} {(n-k)!(2k+1)!}(1 - x)^k \quad (n>0)\\
& = (n+1) \, _2F_1\left(-n,n+2; \frac 3 2; \frac{1-x} 2 \right)

where 2F1 is a hypergeometric function.


Roots and extrema

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

 x_k = \cos\left(\frac{\pi}{2}\,\frac{2k-1}{n}\right),\quad k=1,\ldots,n.

Similarly, the roots of Un are

 x_k = \cos\left(\frac{k}{n+1}\pi\right),\quad k=1,\ldots,n.

One unique property of the Chebyshev polynomials of the first kind is that on the interval −1 ≤ x ≤ 1 all of the extrema have values that are either −1 or 1. Thus these polynomials have only two finite critical values, the defining property of Shabat polynomials. Both the first and second kinds of Chebyshev polynomial have extrema at the endpoints, given by:

T_n(1) = 1\,
T_n(-1) = (-1)^n\,
U_n(1) = n + 1\,
U_n(-1) = (n + 1)(-1)^n.\,

Differentiation and integration

The derivatives of the polynomials can be less than straightforward. By differentiating the polynomials in their trigonometric forms, it's easy to show that:

\frac{d T_n}{d x} = n U_{n - 1}\,
\frac{d U_n}{d x} = \frac{(n + 1)T_{n + 1} - x U_n}{x^2 - 1}\,
\frac{d^2 T_n}{d x^2} = n \frac{n T_n - x U_{n - 1}}{x^2 - 1} = n \frac{(n + 1)T_n - U_n}{x^2 - 1}.\,

The last two formulas can be numerically troublesome due to the division by zero (0/0 indeterminate form, specifically) at x = 1 and x = −1. It can be shown that:

\frac{d^2 T_n}{d x^2} \Bigg|_{x = 1} \!\! = \frac{n^4 - n^2}{3},
\frac{d^2 T_n}{d x^2} \Bigg|_{x = -1} \!\! = (-1)^n \frac{n^4 - n^2}{3}.

Indeed, the following, more general formula holds:

\frac{d^p T_n}{d x^p} \Bigg|_{x = \pm 1} \!\! = (\pm 1)^{n+p}\prod_{k=0}^{p-1}\frac{n^2-k^2}{2k+1}.

This latter result is of great use in the numerical solution of eigenvalue problems.

Concerning integration, the first derivative of the Tn implies that

\int U_n\, dx = \frac{T_{n + 1}}{n + 1}\,

and the recurrence relation for the first kind polynomials involving derivatives establishes that

\int T_n\, dx = \frac{1}{2} \left(\frac{T_{n + 1}}{n + 1} - \frac{T_{n - 1}}{n - 1}\right) = \frac{n T_{n + 1}}{n^2 - 1} - \frac{x T_n}{n - 1}.\,


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}}=
0 &: n\ne m \\
\pi &: n=m=0\\
\pi/2 &: n=m\ne 0

This can be proven by letting  x = \cos(\vartheta) and using the identity  T_n(\cos(\vartheta)) = \cos(n\vartheta) .

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 =
0 &: n\ne m, \\
\pi/2 &: n=m.

(Note that the weight \sqrt{1-x^2} \,\! is, to within a normalizing constant, the density of the Wigner semicircle distribution).

The Tn also satisfy a discrete orthogonality condition:

 \sum_{k=0}^{N-1}{T_i(x_k)T_j(x_k)} =
0 &: i\ne j \\
N &: i=j=0 \\
N/2 &: i=j\ne 0
\end{cases} \,\!

where the xk are the N Gauss–Lobatto zeros of TN(x)

 x_k=\cos\left(\frac{\pi\left(k+\frac{1}{2}\right)}{N}\right) .

Minimal ∞-norm

For any given n ≥ 1, among the polynomials of degree n with leading coefficient 1,

f(x) = \frac1{2^{n-1}}T_n(x)

is the one of which the maximal absolute value on the interval [−1, 1] is minimal.

This maximal absolute value is


and |ƒ(x)| reaches this maximum exactly n + 1 times at

x = \cos \frac{k\pi}{n}\text{ for }0 \le k \le n.


Let's assume that wn(x) is a polynomial of degree n with leading coefficient 1 with maximal absolute value on the interval [−1, 1] less than \frac1{2^{n-1}}.

We define

f_n(x) = \frac1{2^{n-1}}T_n(x) - w_n(x)

Because at extreme points of Tn we have |w_n(x)| < \left|\frac1{2^{n-1}}T_n(x)\right|

f_n(x) > 0 \text{ for } x = \cos \frac{2k\pi}{n} \text{ where } 0 \le 2k \le n
f_n(x) < 0 \text{ for } x = \cos \frac{(2k + 1)\pi}{n} \text{ where } 0 \le 2k + 1 \le n

From the intermediate value theorem, fn(x) has at least n roots. However, this is impossible, as fn(x) is a polynomial of degree n − 1, so the fundamental theorem of algebra implies it has at most n − 1 roots.

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:

  • T_n(x)= \frac 1{{n-\frac 1 2 \choose n}} P_n^{-\frac 1 2, -\frac 1 2}(x)= \frac n 2 C_n^0(x),
  • U_n(x)= \frac 1{2{n+\frac 1 2 \choose n}} P_n^{\frac 1 2,  \frac 1 2}(x)= C_n^1(x).

For every nonnegative integer n, Tn(x) and Un(x) are both polynomials of degree n. They are even or odd functions of x as n is even or odd, so when written as polynomials of x, it only has even or odd degree terms respectively. In fact,

T_n\left(1-2x^2\right)=(-1)^n T_{2n}(x)


2 x U_n\left(1-2x^2\right)= (-1)^n U_{2n+1}(x).

The leading coefficient of Tn is 2n − 1 if 1 ≤ n, but 1 if 0 = n.

Tn are a special case of Lissajous curves with frequency ratio equal to n.

Several polynomial sequences like Lucas polynomials (Ln), Dickson polynomials(Dn), Fibonacci polynomials(Fn) are related to Chebyshev polynomials Tn and Un.

The Chebyshev polynomials of the first kind satisfy the relation

 T_j(x) T_k(x) = \frac{1}{2}\left( T_{j+k}(x) + T_{|j-k|}(x)\right),\quad\forall j,k\ge 0,\,

which is easily proved from the product-to-sum formula for the cosine. The polynomials of the second kind satisfy the similar relation

 T_j(x) U_k(x) = \frac{1}{2}\left( U_{j+k}(x) + U_{k-j}(x)\right),\quad\forall j,k .

Similar to the formula

Tn(cos θ) = cos(nθ)

we have the analogous formula

T2n + 1(sin θ) = ( − 1)nsin((2n + 1)θ).


C_n(x)=2T_n \left(\frac{x}{2}\right).

Then Cn(x) and Cm(x) are commuting polynomials:

Cn(Cm(x)) = Cm(Cn(x)).


The first few Chebyshev polynomials of the first kind in the domain −1 < x < 1: The flat T0, T1, T2, T3, T4 and T5.

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 in the domain −1 < x < 1: The flat U0, U1, U2, U3, U4 and U5. Although not visible in the image, Un(1) = n + 1 and Un(−1) = (n + 1)(−1)n.

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 \,
 U_7(x) = 128x^7 - 192x^5 + 80x^3 - 8x \,
 U_8(x) = 256x^8 - 448 x^6 + 240 x^4 - 40 x^2 + 1 \,
 U_9(x) = 512x^9 - 1024 x^7 + 672 x^5 - 160 x^3 + 10 x. \,

As a basis set

The non-smooth function (top) y = −x3H(−x), where H is the Heaviside step function, and (bottom) the 5th partial sum of its Chebyshev expansion. The 7th sum is indistinguishable from the original function at the resolution of the graph.

In the appropriate Sobolev space, the set of Chebyshev polynomials form a complete basis set, so that a function in the same space can, on −1 ≤ x ≤ 1 be expressed via the expansion:[3]

f(x) = \sum_{n = 0}^\infty a_n T_n(x).

Furthermore, as mentioned previously, the Chebyshev polynomials form an orthogonal basis which (among other things) implies that the coefficients an can be determined easily through the application of an inner product. This sum is called a Chebyshev series or a Chebyshev expansion.

Since a Chebyshev series is related to a Fourier cosine series through a change of variables, all of the theorems, identities, etc. that apply to Fourier series have a Chebyshev counterpart.[3] These attributes include:

  • The Chebyshev polynomials form a complete orthogonal system.
  • The Chebyshev series converges to ƒ(x) if the function is piecewise smooth and continuous. The smoothness requirement can be relaxed in most cases — as long as there are a finite number of discontinuities in ƒ(x) and its derivatives.
  • At a discontinuity, the series will converge to the average of the right and left limits.

The abundance of the theorems and identities inherited from Fourier series make the Chebyshev polynomials important tools in numeric analysis; for example they are the most popular general purpose basis functions used in the spectral method,[3] often in favor of trigonometric series due to generally faster convergence for continuous functions (Gibbs' phenomenon is still a problem).

Example 1

Consider the Chebyshev expansion of log(1 + x). One can express

 \log(1+x) = \sum_{n = 0}^\infty a_n T_n(x).

One can find the coefficients an either through the application of an inner product or by the discrete orthogonality condition. For the inner product,

\int_{-1}^{+1}\frac{T_m(x)\log(1+x)}{\sqrt{1-x^2}}dx = \sum_{n=0}^{\infty}a_n\int_{-1}^{+1}\frac{T_m(x)T_n(x)}{\sqrt{1-x^2}}dx,

which gives

-\log(2) &:n = 0 \\
\frac{-2(-1)^n}{n} &: n > 0.

Alternatively, when you cannot evaluate the inner product of the function you are trying to approximate, the discrete orthogonality condition gives


where δij is the Kronecker delta function and the xk are the N Gauss–Lobatto zeros of TN(x)

 x_k=\cos\left(\frac{\pi\left(k+\frac{1}{2}\right)}{N}\right) .

This allows us to compute the coefficients an very efficiently through the discrete cosine transform


Example 2

To provide another example:

\begin{align}(1-x^2)^\alpha=& -\frac 1 {\sqrt \pi}\frac{\Gamma(\frac 1 2+\alpha)}{\Gamma(\alpha+1)}+ 2^{1-2\alpha} \sum_{n=0} (-1)^n {2\alpha \choose \alpha-n} T_{2n}(x)\\=& 2^{-2\alpha}\sum_{n=0} (-1)^n {2\alpha+1 \choose \alpha-n} U_{2n}(x).\end{align}

Partial sums

The partial sums of

f(x) = \sum_{n = 0}^\infty a_n T_n(x)

are very useful in the approximation of various functions and in the solution of differential equations (see spectral method). Two common methods for determining the coefficients an are through the use of the inner product as in Galerkin's method and through the use of collocation which is related to interpolation.

As an interpolant, the N coefficients of the (N − 1)th partial sum are usually obtained on the Chebyshev–Gauss–Lobatto[4] points (or Lobatto grid), which results in minimum error and avoids Runge's phenomenon associated with a uniform grid. This collection of points corresponds to the extrema of the highest order polynomial in the sum, plus the endpoints and is given by:

x_i = -\cos\left(\frac{i \pi}{N - 1}\right) ; \qquad \ i = 0, 1, \dots, N - 1.

Polynomial in Chebyshev form

An arbitrary polynomial of degree N can be written in terms of the Chebyshev polynomials of the first kind. Such a polynomial p(x) is of the form

p(x) = \sum_{n=0}^{N} a_n T_n(x).

Polynomials in Chebyshev form can be evaluated using the Clenshaw algorithm.

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


  1. ^ Chebyshev polynomials were first presented in: P. L. Chebyshev (1854) "Théorie des mécanismes connus sous le nom de parallélogrammes," Mémoires des Savants étrangers présentés à l’Académie de Saint-Pétersbourg, vol. 7, pages 539–586.
  2. ^ Jeroen Demeyer Diophantine Sets over Polynomial Rings and Hilbert's Tenth Problem for Function Fields, Ph.D. theses (2007), p.70.
  3. ^ a b c Boyd, John P. (2001). Chebyshev and Fourier Spectral Methods (second ed.). Dover. ISBN 0486411834. 
  4. ^ Chebyshev Interpolation: An Interactive Tour


External links

Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Discrete Chebyshev polynomials — Not to be confused with Chebyshev polynomials. In mathematics, discrete Chebyshev polynomials, or Gram polynomials, are a type of discrete orthogonal polynomials used in approximation theory, introduced by Pafnuty Chebyshev (1864) and… …   Wikipedia

  • Chebyshev (disambiguation) — Chebyshev may refer to: Pafnuty Chebyshev: A Russian mathematician Chebyshev polynomials Chebyshev (crater): A lunar crater 2010 Chebyshev: An asteroid from the asteroid belt This disambiguation page lists articles associated with the same title …   Wikipedia

  • Chebyshev filter — Linear analog electronic filters Network synthesis filters Butterworth filter Chebyshev filter Elliptic (Cauer) filter Bessel filter Gaussian filter Optimum L (Legendre) filter Linkwitz Riley filter …   Wikipedia

  • Chebyshev pseudospectral method — The Chebyshev pseudospectral method for optimal control problems is based on Chebyshev polynomials of the first kind. Unlike the Legendre pseudospectral method, the Chebyshev pseudospectral (PS) method does not immediately offer high accuracy… …   Wikipedia

  • Chebyshev rational functions — This article is not about the Chebyshev rational functions used in the design of elliptic filters. For those functions, see Elliptic rational functions. Plot of the Chebyshev rational functions for n=0,1,2,3 and 4 for x between 0.01 and 100. In… …   Wikipedia

  • Chebyshev, Pafnuty Lvovich — ▪ Russian mathematician born May 4 [May 16, New Style], 1821, Okatovo, Russia died November 26 [December 8], 1894, St. Petersburg  founder of the St. Petersburg mathematical school (sometimes called the Chebyshev school), who is remembered… …   Universalium

  • Chebyshev nodes — In numerical analysis, Chebyshev nodes are the roots of the Chebyshev polynomial of the first kind. They are often used as nodes in polynomial interpolation because the resulting interpolation polynomial minimizes the Runge s phenomenon. Contents …   Wikipedia

  • Chebyshev-Markov-Stieltjes inequalities — In mathematics, The Chebyshev ndash;Markov ndash;Stieltjes inequalities are important inequalities related to the problem of moments. They allow to extract some information about the measure from its first moments; namely, they provide sharp… …   Wikipedia

  • Chebyshev–Markov–Stieltjes inequalities — In mathematical analysis, the Chebyshev–Markov–Stieltjes inequalities are inequalities related to the problem of moments that were formulated in the 1880s by Pafnuty Chebyshev and proved independently by Andrey Markov and (somewhat later) by… …   Wikipedia

  • Pafnuty Chebyshev — Chebyshev redirects here. For other uses, see Chebyshev (disambiguation). Pafnuty Chebyshev Pafnuty Lvovich Chebyshev Born May 16, 1821 …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”