A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
MODULAR COMPUTATION FOR MATRICES OF ORE POLYNOMIALS
Computer Algebra 2006
We give a modular algorithm to perform row reduction of a matrix of Ore polynomials with coefficients in Z[t]. Both the transformation matrix and the transformed matrix are computed. The algorithm can be used for finding the rank and left nullspace of such matrices. In the special case of shift polynomials, we obtain algorithms for computing a weak Popov form and for computing a greatest common right divisor (GCRD) and a least common left multiple (LCLM) of matrices of shift polynomials. Ourdoi:10.1142/9789812778857_0004 fatcat:gfsgrov4xrasxgvoghuoadcrae