On condition numbers of polynomial eigenvalue problems (Q972167): Difference between revisions

Condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients are investigated. In Section 3 it is proved that if \(\lambda_0\) is a multiple eigenvalue of the matrix polynomial \(P(\lambda)\) and \(p_0\) is the dimension of the maximum Jordan blocks of \(\lambda_0\), then as \(\epsilon\to 0\), the Hausdorff distance between the connected component of the pseudospectrum \(\sigma_\epsilon(P)\) containing \(\lambda_0\) and the disc centered at \(\lambda_0\) of radius \(r=(\hat{k}(P,\lambda_0)\epsilon)^{1/p_0}\) is \(o(\epsilon^{1/p_0})\). Here \(\hat{k}(P,\lambda_0)\) is the condition number of the multiple eigenvalue \(\lambda_0\). An upper bound of the distance of a simple eigenvalue to the set of matrix polynomials having this eigenvalue with multiplicity bigger than 1 is given in Section 4. More precisely, it is proved that this distance is less than or equal to \[ \frac{c(P'(\lambda_0)) \parallel P(\lambda_0)\parallel} {k(P,\lambda_0) (\parallel y_0^* P'(\lambda_0)\parallel^2 - |y_0^* P'(\lambda_0)x_0|^2)^{1/2}}, \] where \(y_0\) and \(x_0\) are the left and right unit eigenvectors and \(c(A)\) is the condition number of \(A\). In Section 5 an expression of the condition number is obtained without eigenvectors and in Section 6 a bound of the minimum distance between an eigenvalue of a perturbed matrix to the eigenvalues of the original matrix is derived using a technique of \textit{L. Elsner} [Linear Algebra Appl. 71, 77--80 (1985; Zbl 0583.15009)]. All result are illustrated by examples.