2013
DOI: 10.1137/120886741
|View full text |Cite
|
Sign up to set email alerts
|

Locating the Eigenvalues of Matrix Polynomials

Abstract: Some known results for locating the roots of polynomials are extended to the case of matrix polynomials. In particular, a theorem by Pellet [Bull. Sci. Math. (2), 5 (1881), pp. 393--395], some results from Bini [Numer. Algorithms, 13 (1996), pp. 179--200] based on the Newton polygon technique, and recent results from Gaubert and Sharify (see, in particular, [Tropical scaling of polynomial matrices, Lecture Notes in Control and Inform. Sci. 389, Springer, Berlin, 2009, pp. 291--303] and [Sharify, Scaling Algori… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
52
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
9

Relationship

2
7

Authors

Journals

citations
Cited by 50 publications
(52 citation statements)
references
References 18 publications
0
52
0
Order By: Relevance
“…Simple location rules are used for theoretical purposes, as establishing sufficient conditions guaranteeing that p(z) is stable or that all its roots are inside the unit circle, and they are also used in iterative algorithms for computing the roots of p(z) to find initial guesses of the roots for starting the iteration [2,3]. Recently, polynomial eigenvalue problems have received much attention and simple criteria for locating approximately the eigenvalues of matrix polynomials have been developed [4,12], but, to keep the paper concise, matrix polynomials are not covered in this work. Let us denote by λ any root of p(z).…”
Section: Introductionmentioning
confidence: 99%
“…Simple location rules are used for theoretical purposes, as establishing sufficient conditions guaranteeing that p(z) is stable or that all its roots are inside the unit circle, and they are also used in iterative algorithms for computing the roots of p(z) to find initial guesses of the roots for starting the iteration [2,3]. Recently, polynomial eigenvalue problems have received much attention and simple criteria for locating approximately the eigenvalues of matrix polynomials have been developed [4,12], but, to keep the paper concise, matrix polynomials are not covered in this work. Let us denote by λ any root of p(z).…”
Section: Introductionmentioning
confidence: 99%
“…For the particular case of matrix polynomials P (λ) with coefficient matrices of the form A i = σ i Q i with σ i ≥ 0 and Q * i Q i = I, and the 2-norm · 2 , Bini, Noferini, and Sharify [7,Thm. 2.7] have identified annuli of small width defined in terms of the tropical roots of t × p(x) that contain the eigenvalues of P (λ).…”
Section: −1mentioning
confidence: 99%
“…is useful in a number of situations, such as, for example, when selecting the starting points in the Ehrlich-Aberth method for the numerical solution of polynomial eigenvalue problems [6], [7], or in choosing the contour in contour integral methods for polynomial eigenvalue problems of large dimensions [3]. Betcke's diagonal scaling [4, section 5], whose aim is to improve the conditioning of P 's eigenvalues near a target eigenvalue ω, requires a priori knowledge of the magnitude of ω.…”
Section: Introductionmentioning
confidence: 99%
“…We can give reasonable estimates to the modulus of the eigenvalues using the Pellet theorem or the tropical roots (see [19,46,64], for some insight on these tools). We have considered three linearizations: the standard Frobenius companion matrix, and two versions of the extended Smith companion form.…”
Section: The Matrix Casementioning
confidence: 99%