On the Numerical Range of Operator Polynomials (Q3147572)

For a matrix polynomial \(P(\lambda)= A_m \lambda^m+ \dots+A_1\lambda+ A_0\), where \(A_k\), \(0\leq k\leq m\), are \(n\times n\) matrices with complex coefficients, its numerical range is defined by \(W(P)=\{\lambda\in{\mathbb C}: (P(\lambda)x, x)=0\) for some nonzero \(x\in{\mathbb C^n}\}\). If \(A\) is an \(n\times n\) matrix and \(P(\lambda)= \lambda I- A\), then \(W(P)\) reduces to the classical numerical range \(F(A)\) of \(A\). Unlike the classical numerical range \(F(A)\), the set \(W(P)\) need not be connected or convex. The author obtains an upper bound for the number of components of \(W(P)\) in the case where the leading coefficient \(A_m\) of \(P(\lambda)\) satisfies the condition that \(F(A_m) - \{0\}\) is disconnected. He establishes a necessary condition and a sufficient condition for the connectedness of the numerical range of a quadratic selfadjoint matrix polynomial. The boundary of the numerical range of linear matrix polynomials is also considered.