Bauer–Fike theorem

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 78.53.31.187 (talk) at 15:08, 7 April 2014 (→‎Remark). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, the Bauer–Fike theorem is a standard result in the perturbation theory of the eigenvalue of a complex-valued diagonalizable matrix. In its substance, it states an absolute upper bound for the deviation of one perturbed matrix eigenvalue from a properly chosen eigenvalue of the exact matrix. Informally speaking, what it says is that the sensitivity of the eigenvalues is estimated by the condition number of the matrix of eigenvectors.

Theorem (Friedrich L. Bauer, C.T.Fike – 1960)

Let be a diagonalizable matrix, and be the non-singular eigenvector matrix such that . Moreover, let be an eigenvalue of the matrix ; then an eigenvalue exists such that:

where is the usual condition number in p-norm.

Proof

If , we can choose and the thesis is trivially verified (since ).

So, be . Then . being an eigenvalue of , we have and so

and, since as stated above, we must have

which reveals the value −1 to be an eigenvalue of the matrix .

For each consistent matrix norm, we have , so, all p-norms being consistent, we can write:

But being a diagonal matrix, the p-norm is easily computed, and yields:

whence:

The theorem can also be reformulated to better suit numerical methods. In fact, dealing with real eigensystem problems, one often has an exact matrix , but knows only an approximate eigenvalue-eigenvector couple, (,), and needs to bound the error. The following version comes in help.

Theorem (Friedrich L. Bauer, C.T.Fike – 1960) (alternative statement)

Let be a diagonalizable matrix, and be the non singular eigenvector matrix such as . Be moreover (,) an approximate eigenvalue-eigenvector couple, and ; then an eigenvalue exists such that:

where is the usual condition number in p-norm.

Proof

We solve this problem with Tarık's method: m (otherwise, we can choose and theorem is proven, since ). Then exists, so we can write:

since is diagonalizable; taking the p-norm of both sides, we obtain:

But, since is a diagonal matrix, the p-norm is easily computed, and yields:

whence:

The Bauer–Fike theorem, in both versions, yields an absolute bound. The following corollary, which, besides all the hypothesis of Bauer–Fike theorem, requires also the non-singularity of A, turns out to be useful whenever a relative bound is needed.

Corollary

Be a non-singular, diagonalizable matrix, and be the non singular eigenvector matrix such as . Be moreover an eigenvalue of the matrix ; then an eigenvalue exists such that:

(Note: can be formally viewed as the "relative variation of A", just as is the relative variation of λ.)

Proof

Since μ is an eigenvalue of (A+δA) and , we have, left-multiplying by :

that is, putting and :

which means thatis an eigenvalue of, with eigenvector. Now, the eigenvalues of are , while its eigenvector matrix is the same as A. Applying the Bauer–Fike theorem to the matrix and to its eigenvalue, we obtain:

Remark

If A is normal, V is a unitary matrix, and , so that .

The Bauer–Fike theorem then becomes:

( in the alternative formulation)

which obviously remains true if A is a Hermitian matrix. In this case, however, a much stronger result holds, known as the Weyl's theorem on eigenvalues. In the hermitian case on can also restate the Bauer-Fike theorem in the form that the map that maps a matrix to its spectrum is a Non-expansive function w.r.t. the Hausdorff distance on the set of compact subsets of .

References

  1. F. L. Bauer and C. T. Fike. Norms and exclusion theorems. Numer. Math. 2 (1960), 137–141.
  2. S. C. Eisenstat and I. C. F. Ipsen. Three absolute perturbation bounds for matrix eigenvalues imply relative bounds. SIAM Journal on Matrix Analysis and Applications Vol. 20, N. 1 (1998), 149–158