Jump to content

Bauer–Fike theorem

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 99.241.166.168 (talk) at 22:45, 13 May 2014 (formatting improvements). 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.

The setup

In what follows we assume that:

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

Let μ be an eigenvalue of A + δA then there exists λσ(A) such that:

Proof

If μσ(A), we can choose λ = μ and the thesis is trivially verified (since κp(V) ≥ 1).

So suppose μσ(A). Since μ is an eigenvalue of A + δA, we have det(A + δAμI) = 0 and so

However our assumption, μσ(A), implies that: det(Λ − μI) ≠ 0 and therefore we can write:

This reveals −1 to be an eigenvalue of

Since all p-norms are consistent matrix norms we have |λ| ≤ ||A||p where λ is an eigenvalue of A. In this instance this gives us:

But (Λ − μI)−1 is a diagonal matrix, the p-norm of which is easily computed:

whence:

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

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

Let be an approximate eigenvalue-eigenvector couple, and . Then there exists λσ(A) such that:

Proof

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

since A 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

Let μ be an eigenvalue of A + δA then there exists λσ(A) such that:

Note. ||A−1δA|| 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 det(A) ≠ 0, by multiplying by A−1 from left we have:

If we set:

then we have:

which means that is an eigenvalue of , with v an 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:

Or in alternate 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 Aσ(A) that maps a matrix to its spectrum is a Non-expansive function with respect to the Hausdorff distance on the set of compact subsets of C.

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