A direct method to obtain a realization of a polynomial matrix and its applications

Abstract

In this paper we present a Silverman-Ho algorithm-based method to obtain a realization of a polynomial matrix. This method provides the final formulation of a minimal realization directly from a full rank factorization of a specific given matrix. Also, some classical problems in control theory such as model reduction in singular systems or the positive realization problem in standard systems are solved with this method.