Sensitivity of eigenvalue problems
Given a matrix we know that a new matrix obtained via a Similarity transformation has the same eigenvalues. When computing numerically the eigenvalue of a given matrix, it will be convinient to transform the starting matrix in a more simple form using similarity transformation to preserve the spectrum. The following question arises:
If we perturb the starting matrix with , how much this will impact the spectrum?
Consider a diagonalizable matrix . This means there exists an invertivle matrix sush that:
Where is diagonal. Since this is a similarity transformation, the diagonal values are the spectrum of . We now study theoretically the perturbed problem:
Where .
This still is a similarity transformation, hence and share the same eigenvalues.
Call the unperturbed eigenvalues , the perturbed . Our goal is to exstimate the difference .
Consider the eigenvector of the perturbed system:
rearrenging this
we now take norms, using basic propriety of induced matrix norms we get the inequality:
the matrix is just a diagonal matrix whose nonzero entries are:
the 2-norm is just the biggest diagonal absolute value. Call this . Then:
This is result is knows as Bauer-Fike theorem.
Remark If and are normal, then is unitary and .
Bauer-fike theorem
Let be a diagonalizable matrix, and such that is still diagonlaizable. Let be an eigenvalus of , then there exists , eigenvalue of such that:
Remaks In short, this theorm gives us a bound on the distance of the perturbed eigenvalues from a suitable unperturbed eigenvalue.
However it doesn not tell us in wich disk the pertubed eigenvalue are contained, it can happen that they are close to the same unperturbed eigenvalues:
Weyl’s theorem
In the case where and are hermitian, we have a stronger result.
Let and the (real) eigenvalues of and , respectively. Then .