On eigenvalues of rectangular matrices

Abstract

Given a (k+1)-tuple A, B1,...,Bk of (m× n)-matrices with m n we call the set of all k-tuples of complex numbers \1,...,k\ such that the linear combination A+1B1+2B2+...+kBk has rank smaller than m the eigenvalue locus of the latter pencil. Motivated primarily by applications to multi-parameter generalizations of the Heine-Stieltjes spectral problem, see He and Vol, we study a number of properties of the eigenvalue locus in the most important case k=n-m+1.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…