Radau quadrature is a Gaussian quadrature formula with one prescribed endpoint.
For an integer , the
-point rule with weighting function
on the interval
includes
and is exact for all polynomials
of polynomial degree at most
. The remaining
abscissas lie in
, and the general formula
is
|
(1)
|
The free abscissas for
, ...,
are the roots of the polynomial
|
(2)
|
where
is a Legendre polynomial. Equivalently, the
free abscissas are the zeros
of the Jacobi polynomial
(Gautschi 2000). The substitution
gives the corresponding rule with prescribed endpoint
, whose free abscissas
are the zeros of the Jacobi
polynomial
. The weights
of the free abscissas are
|
(3)
| |||
|
(4)
|
and of the endpoint
|
(5)
|
The error term is given by
|
(6)
|
for .
| 2 | 0.5 | |
| 0.333333 | 1.5 | |
| 3 | 0.222222 | |
| 1.02497 | ||
| 0.689898 | 0.752806 | |
| 4 | 0.125 | |
| 0.657689 | ||
| 0.181066 | 0.776387 | |
| 0.822824 | 0.440924 | |
| 5 | 0.08 | |
| 0.446208 | ||
| 0.623653 | ||
| 0.446314 | 0.562712 | |
| 0.885792 | 0.287427 |
The abscissas and weights can be computed analytically for small .
| 2 | ||
| 3 | ||
For a general positive measure on a finite interval, the rule can be computed by modifying the terminal entries of its Jacobi matrix and applying the Golub-Welsch algorithm (Golub 1973).