(Translated by https://www.hiragana.jp/)
Bauer–Fike theorem - Wikipedia Jump to content

Bauer–Fike theorem

From Wikipedia, the free encyclopedia

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 theorem was proved by Friedrich L. Bauer and C. T. Fike in 1960.

The setup[edit]

In what follows we assume that:

The Bauer–Fike Theorem[edit]

Bauer–Fike Theorem. Let μみゅー be an eigenvalue of A + δでるたA. Then there exists λらむだΛらむだ(A) such that:

Proof. We can suppose μみゅーΛらむだ(A), otherwise take λらむだ = μみゅー and the result is trivially true since κかっぱp(V) ≥ 1. 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:

An Alternate Formulation[edit]

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, (λらむだa, va ) and needs to bound the error. The following version comes in help.

Bauer–Fike Theorem (Alternate Formulation). Let (λらむだa, va ) be an approximate eigenvalue-eigenvector couple, and r = Avaλらむだava. Then there exists λらむだΛらむだ(A) such that:

Proof. We can suppose λらむだaΛらむだ(A), otherwise take λらむだ = λらむだa and the result is trivially true since κかっぱp(V) ≥ 1. So (AλらむだaI)−1 exists, so we can write:

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

However

is a diagonal matrix and its p-norm is easily computed:

whence:

A Relative Bound[edit]

Both formulations of Bauer–Fike theorem yield an absolute bound. The following corollary is useful whenever a relative bound is needed:

Corollary. Suppose A is invertible and that μみゅー is 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 1 is an eigenvalue of Aa + (δでるたA)a, with v as an eigenvector. Now, the eigenvalues of Aa are μみゅー/λらむだi, while it has the same eigenvector matrix as A. Applying the Bauer–Fike theorem to Aa + (δでるたA)a with eigenvalue 1, gives us:

The Case of Normal Matrices[edit]

If A is normal, V is a unitary matrix, therefore:

so that κかっぱ2(V) = 1. 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 one 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[edit]

  • Bauer, F. L.; Fike, C. T. (1960). "Norms and Exclusion Theorems". Numer. Math. 2 (1): 137–141. doi:10.1007/BF01386217. S2CID 121278235.
  • Eisenstat, S. C.; Ipsen, I. C. F. (1998). "Three absolute perturbation bounds for matrix eigenvalues imply relative bounds". SIAM Journal on Matrix Analysis and Applications. 20 (1): 149–158. CiteSeerX 10.1.1.45.3999. doi:10.1137/S0895479897323282.