Computing Popov and Hermite forms of rectangular polynomial matrices

02/06/2018
by   Vincent Neiger, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2017

A non-commutative algorithm for multiplying 5x5 matrices using 99 multiplications

We present a non-commutative algorithm for multiplying 5x5 matrices usin...
research
10/09/2020

Deterministic computation of the characteristic polynomial in the time of matrix multiplication

This paper describes an algorithm which computes the characteristic poly...
research
07/14/2016

Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix

Given a nonsingular n × n matrix of univariate polynomials over a field ...
research
06/27/2020

Generic canonical forms for perplectic and symplectic normal matrices

Let B be some invertible Hermitian or skew-Hermitian matrix. A matrix A ...
research
03/07/2019

A Rank-1 Sketch for Matrix Multiplicative Weights

We show that a simple randomized sketch of the matrix multiplicative wei...
research
01/14/2018

Fast computation of approximant bases in canonical form

In this article, we design fast algorithms for the computation of approx...
research
05/30/2017

Fast Computation of the Roots of Polynomials Over the Ring of Power Series

We give an algorithm for computing all roots of polynomials over a univa...

Please sign up or login with your details

Forgot password? Click here to reset