Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial Equations

by   Vincent Neiger, et al.

We give a Las Vegas algorithm which computes the shifted Popov form of an m × m nonsingular polynomial matrix of degree d in expected O(m^ω d) field operations, where ω is the exponent of matrix multiplication and O(·) indicates that logarithmic factors are omitted. This is the first algorithm in O(m^ω d) for shifted row reduction with arbitrary shifts. Using partial linearization, we reduce the problem to the case d <σ/m where σ is the generic determinant bound, with σ / m bounded from above by both the average row degree and the average column degree of the matrix. The cost above becomes O(m^ωσ/m ), improving upon the cost of the fastest previously known algorithm for row reduction, which is deterministic. Our algorithm first builds a system of modular equations whose solution set is the row space of the input matrix, and then finds the basis in shifted Popov form of this set. We give a deterministic algorithm for this second step supporting arbitrary moduli in O(m^ω-1σ) field operations, where m is the number of unknowns and σ is the sum of the degrees of the moduli. This extends previous results with the same cost bound in the specific cases of order basis computation and M-Padé approximation, in which the moduli are products of known linear factors.


page 1

page 2

page 3

page 4


Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix

Consider a matrix 𝐅∈𝕂[x]^m × n of univariate polynomials over a field 𝕂....

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 ...

A fast, deterministic algorithm for computing a Hermite Normal Form of a polynomial matrix

Given a square, nonsingular matrix of univariate polynomials F∈K[x]^n × ...

Computing Canonical Bases of Modules of Univariate Relations

We study the computation of canonical bases of sets of univariate relati...

Faster Modular Composition

A new Las Vegas algorithm is presented for the composition of two polyno...

Fast computation of approximant bases in canonical form

In this article, we design fast algorithms for the computation of approx...

Decoding Interleaved Gabidulin Codes using Alekhnovich's Algorithm

We prove that Alekhnovich's algorithm can be used for row reduction of s...

Please sign up or login with your details

Forgot password? Click here to reset