The distance from a matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue (Q947607): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/j.laa.2008.04.005 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2008.04.005 / rank
 
Normal rank

Latest revision as of 09:23, 10 December 2024

scientific article
Language Label Description Also known as
English
The distance from a matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue
scientific article

    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references