Skip to main navigation Skip to search Skip to main content

Bounds for eigenvalues of matrix polynomials

    Research output: Contribution to journalArticlepeer-review

    Abstract

    Upper and lower bounds are derived for the absolute values of the eigenvalues of a matrix polynomial (or λ-matrix). The bounds are based on norms of the coefficient matrices and involve the inverses of the leading and trailing coefficient matrices. They generalize various existing bounds for scalar polynomials and single matrices. A variety of tools are used in the derivations, including block companion matrices, Gershgorin's theorem, the numerical radius, and associated scalar polynomials. Numerical experiments show that the bounds can be surprisingly sharp on practical problems. © 2002 Elsevier Science Inc.
    Original languageEnglish
    Pages (from-to)5-22
    Number of pages17
    JournalLinear Algebra and its Applications
    Volume358
    Issue number1-3
    DOIs
    Publication statusPublished - 1 Jan 2003

    Keywords

    • λ-Matrix
    • Block companion matrix
    • Gershgorin's theorem
    • Matrix polynomial
    • Numerical radius
    • Polynomial eigenvalue problem

    Fingerprint

    Dive into the research topics of 'Bounds for eigenvalues of matrix polynomials'. Together they form a unique fingerprint.

    Cite this