A lattice-based minimal partial realization algorithm for matrix sequences of varying length

Abstract

In this paper we first extend a minimal partial realization algorithm from vector sequences to matrix sequences of equal length by means of a lattice basis reduction algorithm over polynomial rings. We also give all minimal partial realizations for such matrix sequences and a sufficient and necessary condition for the uniqueness issue. Then we improve the above algorithm to solve the minimal partial realization problem for matrix sequences of varying length.