A generalized minimal partial realization problem (Q677934)

This paper is part of a series of papers which develop a methodology to solve different kinds of interpolation problems: scalar, vector, and matrix rational interpolation problems, Padé, Padé-Hermite, simultaneous Padé approximation, etc. The matrix rational interpolation problem solved here is a generalization of the minimal partial realization problem. To solve this problem, it is linearized and interpreted as a polynomial vector interpolation problem at \(\infty\). The algorithm to compute a basis matrix for this problem is given. It allows to write down all polynomial vector solutions with limited complexity in an easy way.