Partial realization of invariant system descriptions

Abstract
The partial realization of a finite Markov sequence from the Hankel array for linear, constant, multidimensional systems is considered. It is shown that the algorithm to extract the invariants of Popov (1972) from this sequence possesses some attractive nesting properties ; i.e. the algorithm only processes the new data and augments these results to the previous solution. It is shown not only how to determine the minimal partial realization from a fixed number of Markov parameters, but also how to describe the entire class of partial realizations. In addition, a new recursive technique is presented to obtain the corresponding class of minimal extensions.

This publication has 13 references indexed in Scilit: