Gershgorin's theorem

from Wikipedia, the free encyclopedia

The set of Gerschgorin (after the mathematician Semen Aronowitsch Gerschgorin ) is a theorem from the algebra . It says that the complex zeros of a normalized complex polynomial

lie in a circle around the origin with the radius , with the estimates

  • and

be valid.

Gershgorin circles

This theorem is a consequence of the theorem about the Gerschgorin circles in the complex plane, which contain the eigenvalues ​​of a square matrix. For every matrix it holds that the eigenvalues ​​of in the union of the circular disks

around the diagonal elements with radii or when considering the transposed matrix with radii . Each connected component of the union contains as many eigenvalues ​​as there are diagonal elements of the matrix .

Accompanying matrices

If you multiply a polynomial with degree by the variable and reduce the product modulo , a new polynomial with degree is created . This assignment is a linear mapping of the space of the polynomials of degree (or less) into itself. For each base of this -dimensional vector space (more precisely the quotient ring ) a coefficient matrix of this multiplication operator can be given. This is called the companion matrix of the polynomial.

Every accompanying matrix of the polynomial has the polynomial zeros as eigenvalues. The eigenpolynomial for the eigenvalue is , because .

Matrix accompanying the standard basis

The standard basis consists of the monomials . The products are already the minimal degree representatives modulo , for the last basic element applies

.

So the accompanying matrix (in Frobenius form) is

.

The zeros of the polynomial are therefore contained in the union of the circular disks and . Using the transposed accompanying matrix results in the union of the circular disks , and . The estimates given in the introduction result from these two cases.

Supplementary matrix for the basis of the Lagrange interpolation

(cf. Börsch-Supan 1963): Let be pairwise different complex numbers. Then form the polynomials

a base of the space of polynomials of degree smaller . The leading coefficient is 1 in each case . Therefore the minimal representative of just is the polynomial . According to the formula of Lagrange interpolation , this polynomial can be expressed in the selected base:

.

The accompanying matrix thus results in

.

The closer the support points are to the true zeros, the smaller the second summand becomes, that is, the smaller the radii of the Gerschgorin circles.

The zeros of are then in the union of the circular disks

or when using the transposed accompanying matrix in the union of the circular disks

contain. If the selected support points are good approximations of the zeros of p (X) , the union of the circular disks breaks down into connected components, each of which contains a cluster of zeros or a multiple zero. If the zeros are well separated and the approximation is good enough, the disks are disjoint in pairs and each contains exactly one zero.

Another observation is that the centers of the circular disks represent better estimates of the zeros of . If this improvement is repeated in a recursion, the result is the Weierstrass (Durand-Kerner) method .

improvement

A. Neumaier (2003) gives the following improvement of the circular disks in the last example: The zeros are in the circular disks

,

contain. These circular disks are subsets of the circular disks for the transposed matrix in the last example. The radius is reduced by a factor of approximately compared to the formula derived there .

literature

  • W. Börsch-Supan: A posteriori error bounds for the zeros of polynomials. In: Numerical Mathematics. Vol. 5, No. 1, 1963, ISSN  0029-599X , pp. 380-398, doi: 10.1007 / BF01385904 .
  • Howard E. Bell: Gershgorin's Theorem and the Zeros of Polynomials. In: American Mathematical Monthly. Vol. 72, No. 3, March 1965, ISSN  0002-9890 , pp. 292-295.
  • Arnold Neumaier: A Gerschgorin type theorem for zeros of polynomials. ( online ), probably published as Arnold Neumaier: Enclosing clusters of zeros of polynomials . In: Journal of Computational and Applied Mathematics . 156, 2003.