Newtonpedia ES
Home › Mathematics › Chebyshev polynomial
Mathematics · 1854

Chebyshev polynomial

A family of polynomials tied to the cosine and sine functions, used to approximate functions and to choose well-placed interpolation points.

Year
1854
Section
Mathematics

History

Chebyshev polynomials form a family of orthogonal polynomials, meaning that they are mutually independent in a precise mathematical sense. They matter because they let us approximate complicated functions with simple polynomials while keeping the error under tight control. Before their use, polynomial interpolation at evenly spaced points could produce large wild oscillations near the ends of an interval, a problem now known as Runge's phenomenon. Chebyshev polynomials offer a better route: their roots, called Chebyshev nodes, cluster toward the ends of the interval and serve as more suitable sample points.

The starting point is trigonometric. The first-kind polynomials are defined so that T_n(cos θ) equals cos(nθ), meaning the polynomial in x reproduces the cosine of n times an angle. This connection also gives a recursive construction: T_0 is 1, T_1 is x, and each later term is 2x times the previous one minus the one before that. The second-kind polynomials, U_n, follow the same logic but are linked to the sine. Pafnuty Chebyshev studied them in the nineteenth century, and they carry his name. The approximate date of 1854 belongs to this period of his work.

A key idea is that a polynomial can keep its largest error against a continuous function as small as possible. Among all polynomials of degree n with the same leading coefficient, the scaled Chebyshev polynomial has the smallest possible maximum absolute value on the interval from -1 to 1. This minimal-norm property makes interpolation at Chebyshev nodes come close to the best possible approximation. It also leads directly to the Clenshaw-Curtis quadrature method, which computes integrals numerically using these same nodes.

Their reach widened in the twentieth century. In 1952 Cornelius Lanczos showed their usefulness for solving linear systems and for numerical analysis more broadly. The polynomials also appear in the solution of differential equations, where the Chebyshev spectral method uses their derivatives to obtain accurate solutions. Today they are used in electronic filter design, where they allow a fast response with controlled ripple in the passband, in signal processing, and in numerical simulations of fluids and waves. Many scientific software libraries include them as a basic tool for efficient function approximation.

Timeline

  • 1854Approximate date associated with the polynomial family named after Pafnuty Chebyshev.
  • 1952Cornelius Lanczos shows their importance in approximation theory and in solving linear systems.

Trivia and anecdotes

A letter T from spelling

The letter T comes from alternative transliterations of the name Chebyshev, such as Tchebychef or Tschebyscheff.

Other milestones in Mathematics