In linear algebra, a Hilbert matrix, introduced by, is a square matrix with entries being the unit fractions
Hij=
| 1 | |
| i+j-1 |
.
For example, this is the 5 × 5 Hilbert matrix:
H=\begin{bmatrix}1&
| 1 | |
| 2 |
&
| 1 | |
| 3 |
&
| 1 | |
| 4 |
&
| 1 | |
| 5 |
\\
| 1 | |
| 2 |
&
| 1 | |
| 3 |
&
| 1 | |
| 4 |
&
| 1 | |
| 5 |
&
| 1 | |
| 6 |
\\
| 1 | |
| 3 |
&
| 1 | |
| 4 |
&
| 1 | |
| 5 |
&
| 1 | |
| 6 |
&
| 1 | |
| 7 |
\\
| 1 | |
| 4 |
&
| 1 | |
| 5 |
&
| 1 | |
| 6 |
&
| 1 | |
| 7 |
&
| 1 | |
| 8 |
\\
| 1 | |
| 5 |
&
| 1 | |
| 6 |
&
| 1 | |
| 7 |
&
| 1 | |
| 8 |
&
| 1 | |
| 9 |
\end{bmatrix}.
The entries can also be defined by the integral
Hij=
| 1 | |
| \int | |
| 0 |
xi+j-2dx,
that is, as a Gramian matrix for powers of x. It arises in the least squares approximation of arbitrary functions by polynomials.
The Hilbert matrices are canonical examples of ill-conditioned matrices, being notoriously difficult to use in numerical computation. For example, the 2-norm condition number of the matrix above is about 4.8.
introduced the Hilbert matrix to study the following question in approximation theory: "Assume that, is a real interval. Is it then possible to find a non-zero polynomial P with integer coefficients, such that the integral
| b | |
| \int | |
| a |
P(x)2dx
is smaller than any given bound ε > 0, taken arbitrarily small?" To answer this question, Hilbert derives an exact formula for the determinant of the Hilbert matrices and investigates their asymptotics. He concludes that the answer to his question is positive if the length of the interval is smaller than 4.
The Hilbert matrix is symmetric and positive definite. The Hilbert matrix is also totally positive (meaning that the determinant of every submatrix is positive).
The Hilbert matrix is an example of a Hankel matrix. It is also a specific example of a Cauchy matrix.
The determinant can be expressed in closed form, as a special case of the Cauchy determinant. The determinant of the n × n Hilbert matrix is
\det(H)=
| |||||||
| c2n |
,
where
cn=
| n-1 | |
| \prod | |
| i=1 |
in-i=
| n-1 | |
| \prod | |
| i=1 |
i!.
Hilbert already mentioned the curious fact that the determinant of the Hilbert matrix is the reciprocal of an integer (see sequence in the OEIS), which also follows from the identity
| 1 | |
| \det(H) |
=
| c2n | ||||||
|
=n! ⋅
| 2n-1 | |
| \prod | |
| i=1 |
\binom{i}{[i/2]}.
Using Stirling's approximation of the factorial, one can establish the following asymptotic result:
\det(H)\simann-1/4(2\pi)n
| -n2 | |
| 4 |
,
where an converges to the constant
e1/421/12A-3 ≈ 0.6450
n\toinfty
The inverse of the Hilbert matrix can be expressed in closed form using binomial coefficients; its entries are
(H-1)ij=(-1)i+j(i+j-1)\binom{n+i-1}{n-j}\binom{n+j-1}{n-i}\binom{i+j-2}{i-1}2,
where n is the order of the matrix.[1] It follows that the entries of the inverse matrix are all integers, and that the signs form a checkerboard pattern, being positive on the principal diagonal. For example,
\begin{bmatrix}1&
| 1 | |
| 2 |
&
| 1 | |
| 3 |
&
| 1 | |
| 4 |
&
| 1 | |
| 5 |
\\
| 1 | |
| 2 |
&
| 1 | |
| 3 |
&
| 1 | |
| 4 |
&
| 1 | |
| 5 |
&
| 1 | |
| 6 |
\\
| 1 | |
| 3 |
&
| 1 | |
| 4 |
&
| 1 | |
| 5 |
&
| 1 | |
| 6 |
&
| 1 | |
| 7 |
\\
| 1 | |
| 4 |
&
| 1 | |
| 5 |
&
| 1 | |
| 6 |
&
| 1 | |
| 7 |
&
| 1 | |
| 8 |
\\
| 1 | |
| 5 |
&
| 1 | |
| 6 |
&
| 1 | |
| 7 |
&
| 1 | |
| 8 |
&
| 1 | |
| 9 |
\end{bmatrix}-1= \left[\begin{array}{rrrrr} 25&-300&1050&-1400&630\\ -300&4800&-18900&26880&-12600\\ 1050&-18900&79380&-117600&56700\\ -1400&26880&-117600&179200&-88200\\ 630&-12600&56700&-88200&44100 \end{array}\right].
The condition number of the n × n Hilbert matrix grows as
O\left(\left(1+\sqrt{2}\right)4n/\sqrt{n}\right)
The method of moments applied to polynomial distributions results in a Hankel matrix, which in the special case of approximating a probability distribution on the interval [0, 1] results in a Hilbert matrix. This matrix needs to be inverted to obtain the weight parameters of the polynomial distribution approximation.[2]