Hilbert Matrix

In linear algebra, a Hilbert matrix, introduced by , is a square matrix with entries being the unit fractions

: $H_ = \frac.$

For example, this is the 5 × 5 Hilbert matrix:

: $H = \begin 1 & \frac & \frac & \frac & \frac \\ \frac & \frac & \frac & \frac & \frac \\ \frac & \frac & \frac & \frac & \frac \\ \frac & \frac & \frac & \frac & \frac \\ \frac & \frac & \frac & \frac & \frac \end.$

The Hilbert matrix can be regarded as derived from the integral

: $H_ = \int_0^1 x^ \, dx,$

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.

Historical note

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

:$\int_^b P(x)^2 dx$

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.

Properties

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) = \frac,$

where

: $c_n = \prod_^ i^ = \prod_^ 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
: $\frac = \frac = n! \cdot \prod_^ \binom.$

Using Stirling's approximation of the factorial, one can establish the following asymptotic result:

: $\det(H) \sim a_n\, n^(2\pi)^n \,4^,$

where ''a''_''n'' converges to the constant $e^\, 2^\, A^ \approx 0.6450$ as $n \to \infty$, where ''A'' is the Glaisher–Kinkelin constant.

The inverse of the Hilbert matrix can be expressed in closed form using binomial coefficients; its entries are

: $(H^)_ = (-1)^(i + j - 1) \binom \binom \binom^2,$

where ''n'' is the order of the matrix. 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 1 & \frac & \frac & \frac & \frac \\ \frac & \frac & \frac & \frac & \frac \\ \frac & \frac & \frac & \frac & \frac \\ \frac & \frac & \frac & \frac & \frac \\ \frac & \frac & \frac & \frac & \frac \end^ = \left[\begin 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\right].$

The condition number of the ''n'' × ''n'' Hilbert matrix grows as $O\left(\left(1 + \sqrt\right)^/\sqrt\right)$.

Applications

The Method of moments (statistics), 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 , 1results in a Hilbert matrix. This matrix needs to be inverted to obtain the weight parameters of the polynomial distribution approximation.J. Munkhammar, L. Mattsson, J. Rydén (2017
"Polynomial probability distribution estimation using the method of moments"
PLoS ONE 12(4): e0174573.

References

Further reading

*. Reprinted in
*
*
*
*

{{Matrix classes

Numerical linear algebra
Approximation theory
Matrices
Determinants