Efficient algorithm for irreducible realization of a rational matrix

Abstract
A computationally efficient algorithm is presented for irreducible realization of a given rational transfer function matrix. It is shown that either the Hankel matrix for the system or a reduced form of it can be systematically transformed to the Hermite normal form using outer products. The dynamical equations then follow immediately. This algorithm requires less computation than the existing algorithms.

This publication has 5 references indexed in Scilit: