Partially specified matrices and operators: classification, completion, applications (Q1899196)

A matrix \(A\) is called partially specified if some of its elements are given, and the remaining elements are unspecified. Any matrix obtained by assigning values of these unspecified elements is called a completion of \(A\). This important monograph gives an excellent account of the theory and applications of partially specified square matrices and their infinite dimensional generalizations, including a considerable amount of apparently new material. Two main theoretical problems are considered. The first is a classification problem aimed at simplification of the given part using such concepts as block similarity [see the authors, Integral Equations Oper. Theory 3, 350--396 (1980; Zbl 0443.15005)]\ and direct sums of blocks. The second is the eigenvalue completion problem, which considers the extent to which a partially specified matrix determines the eigenvalues (including multiplicities) of its completions. This includes such questions as whether there exists a completion whose eigenvalues include a given set and whether certain numbers must be eigenvalues of all completions. The main applications considered are to stabilization problems in mathematical system theory, to problems of Wiener-Hopf factorization and interpolation for matrix polynomials and rational matrix functions, to the Kronecker structure theory of linear pencils, and to non-everywhere-defined operators. Although certainly not elementary, the book is reasonably self-contained and most of it can be read by anyone with a good knowledge of classical linear algebra.