COMPANION BASED MATRIX FUNCTIONS - DESCRIPTION AND MINIMAL FACTORIZATION

Companion based matrix functions are rational matrix functions admitti ng a minimal realization involving state space matrices that are first companions. Necessary and sufficient conditions are given for a ratio nal matrix function to be companion based. Minimal factorization of su ch functions is discussed in detail. It is shown that the property of being companion based is hereditary with respect to minimal factorizat ion, Also, the issue of minimal factorization is reduced to a division problem for pairs of monic polynomials of the same degree. In this co ntext, a connection with the Euclidean algorithm is made. The results apply to canonical Wiener-Hopf factorization as well as to complete fa ctorization. The analysis of the latter leads to a combinatorial probl em involving the eigenvalues of the state space matrices. The algorith mic aspects of this problem are intimately related to the two machine flow shop problem and Johnson's rule from job scheduling theory.