Explore: Chebyshev Polynomials

The Chebyshev polynomials are two sequences of orthogonal polynomials related to the cosine and sine functions, notated as T n ( x ) {\displaystyle T_{n}(x)}

analysis, Chebyshev nodes (also called Chebyshev points or a Chebyshev grid) are a set of specific algebraic numbers used as nodes for polynomial interpolation

the Chebyshev inequality (which can be used to prove the weak law of large numbers), the Bertrand–Chebyshev theorem, Chebyshev polynomials, Chebyshev linkage

named after Pafnuty Chebyshev because its mathematical characteristics are derived from Chebyshev polynomials. Type I Chebyshev filters are usually referred

In mathematics, discrete Chebyshev polynomials, or Gram polynomials, are a type of discrete orthogonal polynomials used in approximation theory, introduced

Gegenbauer polynomials form the most important class of Jacobi polynomials; they include the Chebyshev polynomials, and the Legendre polynomials as special

a polynomial of degree N. One can obtain polynomials very close to the optimal one by expanding the given function in terms of Chebyshev polynomials and

(1 − x2)α–1/2. They generalize Legendre polynomials and Chebyshev polynomials, and are special cases of Jacobi polynomials. They are named after Leopold Gegenbauer

equation and the Chebyshev polynomials: If T i ( x ) {\displaystyle T_{i}(x)} and U i ( x ) {\displaystyle U_{i}(x)} are the Chebyshev polynomials of the first

"quadrature", that are based on an expansion of the integrand in terms of Chebyshev polynomials. Equivalently, they employ a change of variables x = cos ⁡ θ {\displaystyle