Computing hermite forms of polynomial matrices

  title={Computing hermite forms of polynomial matrices},
  author={Somi Gupta and Arne Storjohann},
  booktitle={ISSAC '11},
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

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.
Bit Complexity of Jordan Normal Form and Spectral Factorization
The bit complexity of two related fundamental computational problems in linear algebra and control theory is studied, and simple and judiciously combine techniques from numerical and symbolic computation, yielding significant advantages over either approach by itself.
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 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
Efficient algorithms and implementation in exact linear algebra. (Algorithmes et implantations efficaces en algèbre linéaire exacte)
This paper provides an algorithm that reduces the complexity to matrix multiplication and that allows to outperform in practice the best asymptotic algorithms on a wide range of values and designs a novel approach that aims to minimize the number of synchronizations inherent to fine grained parallel computing.
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
Fast computation of approximant bases in canonical form


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.
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.
A uniform approach for the fast computation of Matrix-type Padé approximants
A recurrence relation is presented for the computation of a basis for the corresponding linear solution space of these approximants, which generalizes previous work by Van Barel and Bultheel and, in a more general form, by Beckermann.
A course in computational algebraic number theory
  • H. Cohen
  • Computer Science, Mathematics
    Graduate texts in mathematics
  • 1993
The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods.
Shifted normal forms of polynomial matrices
lIotl gives a fractiorl-frw algorithm for computing niatris riormal forms and is able to c11lbct1 tlic probleni of conqmtiug il normal forni into 0Iic of deterniiJIing a sliift.