The distance from a matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue (Q947607)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The distance from a matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue |
scientific article; zbMATH DE number 5349124
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The distance from a matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue |
scientific article; zbMATH DE number 5349124 |
Statements
The distance from a matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue (English)
0 references
6 October 2008
0 references
For a given matrix polynomial \(P(\lambda )=\sum _{i=0}^mA_i\lambda ^i\), where the \(A_i\) are \(n\times n\) complex matrices, and for a given complex number \(\mu\) and integer \(\kappa \geq 2\), the authors determine the distance (suitably defined) from \(P(\lambda )\) to the set of matrix polynomials having \(\mu\) as an eigenvalue of geometric multiplicity at least \(\kappa\). They also obtain bounds for the distance from \(P(\lambda )\) to the set of matrix polynomials which have \(\mu\) as a multiple eigenvalue of any sort. This generalizes a result of \textit{A. N. Malyshev} [Numer. Math. 83, 443--454 (1999; Zbl 0972.15011)].
0 references
matrix polynomial
0 references
multiple eigenvalue
0 references
perturbation
0 references
\(\varepsilon\)-pseudospectrum
0 references
distance
0 references
0 references