Back to Search
Start Over
Distance bounds for prescribed multiple eigenvalues of matrix polynomials
- Source :
- Linear Algebra and its Applications. 436(11):4107-4119
- Publication Year :
- 2012
- Publisher :
- Elsevier BV, 2012.
-
Abstract
- In this paper, motivated by a problem posed by Wilkinson, we study the coefficient perturbations of a (square) matrix polynomial to a matrix polynomial that has a prescribed eigenvalue of specified algebraic multiplicity and index of annihilation. For an n × n matrix polynomial P ( λ ) and a given scalar μ ∈ C , we introduce two weighted spectral norm distances, E r ( μ ) and E r , k ( μ ) , from P ( λ ) to the n × n matrix polynomials that have μ as an eigenvalue of algebraic multiplicity at least r and to those that have μ as an eigenvalue of algebraic multiplicity at least r and maximum Jordan chain length (exactly) k, respectively. Then we obtain a lower bound for E r , k ( μ ) , and derive an upper bound for E r ( μ ) by constructing an associated perturbation of P ( λ ) .
- Subjects :
- Discrete mathematics
Numerical Analysis
Algebra and Number Theory
Eigenvalue
Scalar (mathematics)
Matrix norm
Algebraic multiplicity
Singular vector
Upper and lower bounds
Polynomial matrix
Perturbation
Matrix polynomial
Combinatorics
Singular value
Generalized eigenvector
Discrete Mathematics and Combinatorics
Index of annihilation
Geometry and Topology
Eigenvalues and eigenvectors
Mathematics
Subjects
Details
- ISSN :
- 00243795
- Volume :
- 436
- Issue :
- 11
- Database :
- OpenAIRE
- Journal :
- Linear Algebra and its Applications
- Accession number :
- edsair.doi.dedup.....803e0adfbd7438c09fb51d303ba16b4e
- Full Text :
- https://doi.org/10.1016/j.laa.2012.01.003