Abstract
Let P(λ) be an n x n matrix polynomial with bounded numerical range W(P) and let n > 2. If Ω is a connected subset of W(P), then the set
is also connected. As a consequence, if P(λ) is selfadjoint, then every \(\omega \in \overline {\left( {W\left( P \right)\backslash \mathbb{R}} \right)} \cap \mathbb{R}\) is a multiple root of the equation \({\text{ }}x_\omega ^*P\left( \lambda \right){x_\omega } = 0\) for some unit \({x_\omega } \in {{\Bbb C}^n}\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lancaster, P., Psarrakos, P., The numerical range of selfadjoint quadratic matrix polynomials, preprint (2000).
Li, C.-K., Rodman, L., Numerical range of matrix polynomials, SIAM J. Matrix Anal. Applic. 15 (1994), 1256–1265.
Lyubich, Y., Separation of roots of matrix and operator polynomials, Integral Equations and Operator Theory 29 (1998), 52–62.
Lyubich, Y., Markus, A.S., Connectivity of level sets of quadratic forms and Hausdorff-Toeplitz type theorems, Positivity 1 (1997), 239–254.
Maroulas, J., Psarrakos, P., A connection between numerical ranges of selfadjoint matrix polynomials, Linear and Multilinear Algebra 44 (1998), 327–340.
Ostrowski, A.M., Solutions of equations in Euclidean and Banach spaces, Academic Press, New York 1973.
Willard, S., General Topology, Addison-Wesley Publ. Company 1970.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Basel AG
About this paper
Cite this paper
Psarrakos, P.J. (2002). A Note on the Level Sets of a Matrix Polynomial and Its Numerical Range. In: Gohberg, I., Langer, H. (eds) Linear Operators and Matrices. Operator Theory: Advances and Applications, vol 130. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8181-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8181-4_20
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9467-8
Online ISBN: 978-3-0348-8181-4
eBook Packages: Springer Book Archive