proof of Bauer-Fike theorem
We can assume ˜λ∉σ(A) (otherwise, we can choose λ=˜λ and theorem is proven, since κp(X)>1). Then (A-˜λI)-1 exists, so we can write:
˜u=(A-˜λI)-1r=X(D-˜λI)-1X-1r |
since A is diagonalizable; taking the p-norm (http://planetmath.org/VectorPnorm) of both sides, we obtain:
1 | = | ∥˜u∥p | ||
= | ∥X(D-˜λI)-1X-1r∥p≤∥X∥p∥(D-˜λI)-1∥p∥X-1∥p∥r∥p | |||
= | κp(X)∥(D-˜λI)-1∥p∥r∥p. |
But, since (D-˜λI)-1 is a diagonal matrix, the p-norm is easily computed, and yields:
∥(D-˜λI)-1∥p=max∥x∥p≠0∥(D-˜λI)-1x∥p∥x∥p=maxλ∈σ(A)1|λ-˜λ|=1minλ∈σ(A)|λ-˜λ| |
whence:
minλ∈σ(A)|λ-˜λ|≤κp(X)|| |
Title | proof of Bauer-Fike theorem |
---|---|
Canonical name | ProofOfBauerFikeTheorem |
Date of creation | 2013-03-22 15:33:08 |
Last modified on | 2013-03-22 15:33:08 |
Owner | Andrea Ambrosio (7332) |
Last modified by | Andrea Ambrosio (7332) |
Numerical id | 9 |
Author | Andrea Ambrosio (7332) |
Entry type | Proof |
Classification | msc 15A42 |