Home > ELA > Vol. 30 (2015)

#### Article Title

#### Keywords

Matrix pencil, Pseudospectrum, Backward error, Multiple eigenvalue, Defective pencil, Wilkinson’s problem

#### Abstract

Suppose that an n-by-n regular matrix pencil A -\lambda B has n distinct eigenvalues. Then determining a defective pencil E−\lambda F which is nearest to A−\lambda B is widely known as Wilkinson’s problem. It is shown that the pencil E −\lambda F can be constructed from eigenvalues and eigenvectors of A −\lambda B when A − \lambda B is unitarily equivalent to a diagonal pencil. Further, in such a case, it is proved that the distance from A −\lambda B to E − \lambdaF is the minimum “gap” between the eigenvalues of A − \lambdaB. As a consequence, lower and upper bounds for the “Wilkinson distance” d(L) from a regular pencil L(\lambda) with distinct eigenvalues to the nearest non-diagonalizable pencil are derived.Furthermore, it is shown that d(L) is almost inversely proportional to the condition number of the most ill-conditioned eigenvalue of L(\lambda).

#### Recommended Citation

Ahmad, Sk. Safique and Alam, Rafikul.
(2015),
"On Wilkinson's problem for matrix pencils",
*Electronic Journal of Linear Algebra*,
Volume 30, pp. 632-648.

DOI: https://doi.org/10.13001/1081-3810.3145

*Abstract*