Root vectors of polynomial and rational matrices: Theory and computation

The notion of root polynomials of a polynomial matrix P(lambda) was thoroughly studied in Dopico and Noferini (2020) [6]. In this paper, we extend such a systematic approach to general rational matrices R(lambda), possibly singular and possibly with coalescent pole/zero pairs. We discuss the related theory for rational matrices with coefficients in an arbitrary field. As a byproduct, we obtain sensible definitions of eigenvalues and eigenvectors of a rational matrix R(lambda), without any need to assume that R(lambda) has full column rank or that the eigenvalue is not also a pole. Then, we specialize to the complex field and provide a practical algorithm to compute them, based on the construction of a minimal state space realization of the rational matrix R(lambda) and then using the staircase algorithm on the linearized pencil to compute the null space as well as the root polynomials in a given point lambda 0. If lambda 0 is also a pole, then it is necessary to apply a preprocessing step that removes the pole while making it possible to recover the root vectors of the original matrix: in this case, we study both the relevant theory (over a general field) and an algorithmic implementation (over the complex field), still based on minimal state space realizations.(c) 2022 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).