Reconstruction of a rational nonsquare matrix function from local data

In many problems the local zero-pole structure (i.e. locations of zeros and poles together with their orders) of a scalar rational functionw is a key piece of structure. Knowledge of the order of the pole or zero of the rational functionw at the point is equivalent to knowledge of the-module (where is the space of rational functions analytic at ). For the more intricate case of a rationalp×m matrix functionW, we consider the structure of the module as the appropriate analogue of zero-pole structure (location of zeros and poles together with directional information), where is the set of column vectors of heightm with entries equal to rational functions which are analytic at . Modules of the form in turn can be explicitly parametrized in terms of a collection of matrices (C,A,B,B,) together with a certain row-reduced(p–m)×m matrix polynomialP(z) (which is independent of ) which satisfy certain normalization and consistency conditions. We therefore define the collection (C,A,Z,B,,P(z)) to be the local spectral data set of the rational matrix functionW at . We discuss the direct problem of how to compute the local spectral data explicitly from a realizationW(z)=D+C(z–A)^–1B forW and solve the inverse problem of classifying which collections (C,A,Z,B,,P(z)) satisfying the local consistency and normalization conditions arise as the local spectral data sets of some rational matrix functionW. Earlier work in the literature handles the case whereW is square with nonzero determinant.