A Fortran subroutine for column reduction of polynomial matrices
A.J. Geurts, Cornelis Praagman · TU/e Research Portal · 1994
In this report we describe a subroutine that takes an arbitrary polynomial matrix P as input, and yields on output a unimodular polynomial matrix (I and a column reduced polynomial matrix R such that PU = R. The subroutine is hased 011 the algorithm described in the paper by Neven and Praagman. The subroutine was run on foUl different computers, with comparable results. \Ve found examples iu which the routhle behaves well, a.s well as examples in which the routine performs poorly, if no precautions a.re takeu. \Ve provide both kinds of examples and discuss the cause of the beha.vior of the routine. From these considerations a guideline for the use of the routine is derived.