2013
DOI: 10.1016/j.laa.2013.05.003
|View full text |Cite
|
Sign up to set email alerts
|

Generalization and variations of Pellet’s theorem for matrix polynomials

Abstract: We derive a generalized matrix version of Pellet's theorem, itself based on a generalized Rouché theorem for matrix-valued functions, to generate upper, lower, and internal bounds on the eigenvalues of matrix polynomials. Variations of the theorem are suggested to try and overcome situations where Pellet's theorem cannot be applied.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
29
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 31 publications
(29 citation statements)
references
References 15 publications
0
29
0
Order By: Relevance
“…[17] the result can be extended to any subordinate norm by using Theorem 2.1. Throughout this section, roots of polynomials are counted with multiplicity: in particular, a double positive root is thought of as two coincident positive roots.…”
Section: It Does Not Have Any Eigenvalue In the Open Annulusmentioning
confidence: 98%
See 3 more Smart Citations
“…[17] the result can be extended to any subordinate norm by using Theorem 2.1. Throughout this section, roots of polynomials are counted with multiplicity: in particular, a double positive root is thought of as two coincident positive roots.…”
Section: It Does Not Have Any Eigenvalue In the Open Annulusmentioning
confidence: 98%
“…As shown in section 3 our tropical localization results are less tight than those from the generalized Pellet's theorem, both in the form given in [7,Thm. 2.1] and in [17,Thm. 3.3], but they are easier to interpret.…”
Section: −1mentioning
confidence: 99%
See 2 more Smart Citations
“…The matrix norms are assumed to be subordinate (induced by a vector norm). [2,7,15].) All eigenvalues of the matrix polynomial P (z) = A n z n + A n−1 z n−1 + · · · + A 1 z + A 0 , where n ≥ 2 and A j ∈ C m×m , for j = 0, .…”
Section: Theorem 41 (Cauchy's Theorem -Original Scalar Version) (Seementioning
confidence: 99%