Column reduction of polynomial matrices; some remarks on the algorithm of wolovich

Recently an algorithm has been developed for column reduction of polynomial matrices. In a previous report the authors described a Fortran implementation of this algorithm. In this paper we compare the results of that implementation with an implementation of the algorithm originally developed by Wolovich. We conclude that the complexity of the Wolovich algorithm is lower, but in complicated cases the rst mentioned algorithm yields better results