Computing Popov and Hermite forms of rectangular polynomial matrices

2018/02/06 by Neiger, Vincent, Rosenkilde, Johan, Solomatov, Grigory · 1 citation
#FOS: Computer and information sciences #Symbolic Computation (cs.SC)

paper · doi:10.48550/arxiv.1802.01928

Abstract

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 ones by a factor which is at least the largest dimension of the input matrix.

Cited by

• A generalized Hurwitz stability criterion via rectangular block Hankel matrices for nonmonic matrix polynomials

Related

• A fast, deterministic algorithm for computing a Hermite Normal Form of a polynomial matrix
• Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
• A Polynomial-time Algorithm to Compute Generalized Hermite Normal Form of Matrices over Z[x]
• A cubic algorithm for computing the Hermite normal form of a nonsingular integer matrix
• Deterministic computation of the characteristic polynomial in the time\n of matrix multiplication