Computing hermite forms of polynomial matrices

@inproceedings{Gupta2011ComputingHF,
  title={Computing hermite forms of polynomial matrices},
  author={Somi Gupta and Arne Storjohann},
  booktitle={ISSAC '11},
  year={2011}
}
This paper presents a new algorithm for computing the Hermite form of a polynomial matrix. Given a nonsingular <i>n</i> x <i>n</i> matrix <i>A</i> filled with degree <i>d</i> polynomials with coefficients from a field, the algorithm computes the Hermite form of <i>A</i> using an expected number of (<i>n</i>3<i>d</i>)<sup>1+o(1)</sup> field operations. This is the first algorithm that is both softly linear in the degree <i>d</i> and softly cubic in the dimension <i>n</i>. The algorithm is… 

Figures from this paper

Hermite Forms of Polynomial Matrices

This thesis presents a new algorithm for computing the Hermite form of a polynomial matrix. Given a nonsingular n×n matrix A filled with degree d polynomials with coefficients from a field, the

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

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

We give a Las Vegas algorithm which computes the shifted Popov form of an m x m nonsingular polynomial matrix of degree d in expected ~O(mω d) field operations, where ω is the exponent of matrix

Computing Popov and Hermite Forms of Rectangular Polynomial Matrices

Deterministic, fast algorithms for rectangular input matrices for normal forms for matrices over the univariate polynomials are presented.

Computing Canonical Bases of Modules of Univariate Relations

The triangular shape of M is exploited to generalize a divide-and-conquer approach which originates from fast minimal approximant basis algorithms and relies on high-order lifting to perform fast modular products of polynomial matrices of the form P F mod M.

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

The method relies of a fast algorithm for determining the diagonal entries of its Hermite normal form, having as cost $O^{\sim}\left(n^{\omega}s\right)$ operations with $s$ the average of the column degrees of $\mathbf{F}$.

Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions

The Hermite normal form of that matrix yields the sought lexicographic Gröbner basis, under assumptions which cover the shape position case, which improves upon both state-of-the-art complexity bounds O~(tD2) and O ~(Dω, since ω<3 and t≤D), and confirms the high practical benefit.

Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts

To obtain the target cost for any shift, the properties of the output bases are strengthened, and of those obtained during the course of the algorithm: all the bases are computed in shifted Popov form, whose size is always O(m σ), and a divide-and-conquer scheme is designed.

Fast Order Basis and Kernel Basis Computation and Related Problems

  • W. Zhou
  • Computer Science, Mathematics
  • 2013
The use of the average column degrees instead of the commonly used matrix degrees, or equivalently the maximum column degrees, makes the computational costs more precise and tighter, and the shifted minimal bases computed by the algorithms are more general than the standard minimal bases.

Bases of relations in one or several variables: fast algorithms and applications. (Bases de relations en une ou plusieurs variables : algorithmes rapides et applications)

In this thesis, we study algorithms for a problem of finding relations in one or several variables. It generalizes that of computing a solution to a system of linear modular equations over a

References

SHOWING 1-10 OF 34 REFERENCES

A linear space algorithm for computing the hermite normal form

The presented algorithm has the same time complexity of the asymptotically fastest (but space inefficient) algorithms and a heuristic algorithm for HNF that achieves a substantial speedup when run on randomly generated input matrices.

On the complexity of polynomial matrix computations

Under the straight-line program model, it is shown that multiplication is reducible to the problem of computing the coefficient of degree <i>d</i> of the determinant and algorithms for minimal approximant computation and column reduction that are based on polynomial matrix multiplication are proposed.

Efficient computation of order bases

The algorithm extends earlier work of Storjohann, whose method can be used to find a subset of an order basis that is within a specified degree bound δ using <i>O</i>~(MM(<i>n,δ</i))) field operations for δ≥⌈ <i-m</i><sup>ω</sup>⌉/<i-n</i>, and order σ.

Computing Popov and Hermite forms of polynomial matrices

These results are obtamed by applying in the matrix case, the techniques used in the scalar case of the gcd of polynomials to the Hermite normal form.

Normal forms for general polynomial matrices

Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix

The upper bounds derived on the computational complexity of the algorithms above improve the upper bounds given by Kannan and Bachem in [SIAM J. Comput., 8 (1979), pp. 499–507].

On computing the determinant and Smith form of an integer matrix

A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix by computing the Smith form of the integer matrix an extremely useful canonical form in itself.

Asymptotically fast computation of Hermite normal forms of integer matrices

This paper presents a new algorithm for computing the Hermite normal form H of an A Z n m of rank m to gether with a unimodular pre multiplier matrix U such that UA H Our algorithm requires O m nM m

Essentially optimal computation of the inverse of generic polynomial matrices