Classical Chebyshev quadrature is a quadrature rule for numerical integration, using weighting
function
on the closed interval
and equal weights
, where
is a positive integer.
The abscissas are chosen to integrate polynomials
of degree at most
exactly. The formula with its
error term is
|
(1)
|
where
is the error and the abscissas
are found by taking terms through
in the Maclaurin series of
|
(2)
|
The expression has a removable singularity at ,
with
.
If
denotes the truncated Maclaurin series, define
|
(3)
|
The roots of then give the abscissas.
The first few values are
|
(4)
| |||
|
(5)
| |||
|
(6)
| |||
|
(7)
| |||
|
(8)
| |||
|
(9)
| |||
|
(10)
| |||
|
(11)
| |||
|
(12)
| |||
|
(13)
|
The polynomial sequence includes the formal initial value .
The least common multiple of the denominators
of the coefficients of
is given by OEIS A002680,
starting at
.
Multiplying each
by this integer gives the coefficient number triangle OEIS A101270,
read in increasing powers, including zero coefficients.
For ,
the roots are all real only
for
,
2, ..., 7 and
,
which are the permissible orders for this rule (Hildebrand 1956; Gautschi 1976, p. 101).
The rule is exact for polynomials of degree
at most
for odd
and
for even
. For these orders, if
is real-valued and has continuous
derivatives through order
for odd
or
for even
on
, the error term is
|
(14)
|
for some
(Gautschi 1976, pp. 115-116), where
|
(15)
|
The first few values of are 2/3, 8/45, 1/15, 32/945, 13/756, and 16/1575 (Hildebrand
1956). Beyer (1987) gives abscissas up to
and Hildebrand (1956) up to
.
| 2 | |
| 3 | 0 |
| 4 | |
| 5 | 0 |
| 6 | |
| 7 | 0 |
| 9 | 0 |
The abscissas can be computed analytically for small .
| 2 | |
| 3 | 0 |
| 4 | |
| 5 | 0 |