A new method for computing a column reduced polynomial matrix (Q1104046): Difference between revisions

The new method proposed by the authors is based on reformulating the problem of constructing a column reduced form of a given polynomial matrix as a problem of constructing a minimal polynomial basis for the right null space of a polynomial matrix closely related to the original one. Two algorithms and several numerical examples illustrating these algorithms are given. The authors conclude that the numerical qualities of their method are completely determined by those of an earlier algorithm for constructing a minimal polynomial basis for the kernel of a polynomial matrix. Also, they claim that the upper bounds for the roundoff errors are too generous and the computed results agree with the exact ones within the order of machine precision.