A Practical Implementation of a Modular Algorithm for Ore Polynomial Matrices [chapter]

Howard Cheng, George Labahn
2014 Computer Mathematics  
We briefly review a modular algorithm to perform row reduction of a matrix of Ore polynomials with coefficients in Z[t], and describe a practical implementation in Maple that improves over previous modular and fraction-free versions. The algorithm can be used for finding the rank, left nullspace, and the Popov form of such matrices.
doi:10.1007/978-3-662-43799-5_5 dblp:conf/ascm/ChengL09 fatcat:rgnfx3yvgff4pc2aoujh6mioeq