Chebyshev quadrature is a term used in numerical analysis for quadrature formulas that approximate an integral by equally weighted function values. In a related but distinct usage, it denotes Gauss–Chebyshev quadrature, a Gaussian integration rule for particular weight functions associated with Chebyshev polynomials. These meanings overlap for the first-kind Chebyshev weight, whose Gaussian quadrature formula has equal weights, but they are not interchangeable in general.
Equal-weight quadrature
Let be a positive measure on an interval , with finite total mass
An -node equal-weight quadrature formula has the form
The points are called nodes. Unlike a general quadrature rule, which allows a separate weight at every node, this formula fixes all weights at . The nodes are chosen to make the formula exact for a specified class of functions, usually polynomials.
The rule has algebraic degree of exactness if it integrates every polynomial of degree at most exactly but fails for at least one polynomial of degree . Some existence results instead state only that the degree is at least .
Equal weights do not mean equally spaced nodes. The equality concerns the coefficients multiplying the function values, not the distances between sampling points.
Moment conditions
Exactness through degree is equivalent to
The equation for holds automatically. The other equations require the discrete distribution on the nodes to reproduce the first moments of the normalized measure.
For ordinary integration on , these conditions become
They form a nonlinear system of equations in the node coordinates—not a linear system, despite each condition being a sum of powers. Symmetric node sets automatically satisfy all the odd-moment equations.
For example,
is an equal-weight rule exact through degree . It is also the two-node Gauss–Legendre rule.
Relation to Gaussian quadrature
A general -node quadrature formula has the form
For a positive measure with sufficiently rich support and finite moments, Gaussian quadrature chooses both the nodes and the weights to achieve degree . Its nodes are the zeros of the degree- member of the corresponding family of orthogonal polynomials.
Equal-weight quadrature imposes the extra restrictions
Consequently, it generally cannot achieve Gaussian exactness with the same number of nodes. Finding a rule becomes an existence and node-placement problem rather than simply computing the usual Gaussian nodes.
The upper bound on polynomial exactness can be understood directly. For any distinct nodes, define
This polynomial has degree , is nonnegative, and vanishes at every node. Thus , whereas its integral is positive whenever the measure is not concentrated on those nodes. No such rule can then be exact for all polynomials of degree .
In the equal-weight literature, a central question is therefore: for a specified measure and target degree , how many nodes are needed? The answer depends strongly on the measure. Formulations also differ over whether repeated nodes are permitted.
Gauss–Chebyshev quadrature of the first kind
The most familiar explicit Chebyshev rule concerns
Its weight function is
The Chebyshev polynomials of the first kind satisfy
Their zeros give the quadrature nodes:
All quadrature weights are equal:
This formula is exact for every polynomial of degree at most . It is therefore both a Gaussian rule and an equal-weight rule.
Angular interpretation
The substitution gives
The angular nodes
are the midpoints of equal subintervals of . Thus the rule is a midpoint rule in the angular variable, although its -nodes are not equally spaced: they cluster near and .
Polynomial exactness can also be seen through the cosine representation of the Chebyshev polynomials. The equal-angle sum reproduces their weighted integrals through degree .
Error formula
If has a continuous derivative of order on , then for some ,
Here denotes a factorial.
This is a theoretical remainder formula, not generally a directly computable error estimate: the point is unknown. For smooth functions, convergence can be rapid; for functions with limited regularity or additional singularities, convergence may be substantially slower.
Second-kind Gauss–Chebyshev quadrature
A related Gaussian rule uses the weight
Its nodes are the zeros of the second-kind Chebyshev polynomial :
The formula is
It is also exact through degree , but its weights are generally unequal. Thus a rule called “Gauss–Chebyshev quadrature” need not be Chebyshev quadrature in the strict equal-weight sense.
Interpretation and applications
If is normalized to a probability distribution, an equal-weight quadrature formula approximates an expected value by an arithmetic average:
Unlike ordinary Monte Carlo integration, its nodes are selected deterministically to satisfy exactness conditions rather than generated as independent random samples.
First-kind Gauss–Chebyshev quadrature is especially convenient when the integral already contains the inverse-square-root endpoint weight. It is also useful in computations involving Chebyshev expansions and approximation theory, because its nodes and weights have explicit formulas.
The weight must nevertheless match the problem. Applying the first-kind formula directly to does not approximate the unweighted integral . Although that integral can be rewritten as
the transformed numerator may lose endpoint smoothness. Consequently, the high polynomial exactness of the weighted rule does not automatically imply equally favorable performance for an unweighted integral.