A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Computing Popov and Hermite Forms of Rectangular Polynomial Matrices
2018
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation - ISSAC '18
We consider the computation of two normal forms for matrices over the univariate polynomials: the Popov form and the Hermite form. For matrices which are square and nonsingular, deterministic algorithms with satisfactory cost bounds are known. Here, we present deterministic, fast algorithms for rectangular input matrices. The obtained cost bound for the Popov form matches the previous best known randomized algorithm, while the cost bound for the Hermite form improves on the previous best known
doi:10.1145/3208976.3208988
dblp:conf/issac/NeigerRS18
fatcat:cqnimb4e6fgihfddi7b2ur3ybu