Fast parallel computation of hermite and smith forms of polynomial matrices

  title={Fast parallel computation of hermite and smith forms of polynomial matrices},
  author={Erich L. Kaltofen and Mukkai S. Krishnamoorthy and B. David Saunders},
  journal={Siam Journal on Algebraic and Discrete Methods},
Boolean circuits of polynomial size and polylogarithmic depth are given for computing the Hermite and Smith normal forms of polynomial matrices over finite fields and the field of rational numbers. The circuits for the Smith normal form computation are probabilistic ones and also determine very efficient sequential algorithms. Furthermore, we give a polynomial-time deterministic sequential algorithm for the Smith normal form over the rationals. The Smith normal form algorithms are applied to… 
Preconditioning of rectangular polynomial matrices for efficient Hermite normal form computation
A Las Vegas probabilistic algorithm for reducing the computation of Hermite normal forms of rectangular polynomial matrices allows for the efficient computation of one-sided GCD’S of two matrix polynomials along with the solution of the matrix diophantine equation associated to such a GCD.
Parallelism in Hermite and Smith normal forms
The Smith and Hermite normal forms play an important role in various fields of investigations. In many applications it is crucial to compute the Smith or Hermite normal form of an integral matrix. A
On Computing the Hermite Form of a Matrix of Differential Polynomials
Given a matrix over the ring of differential polynomials, we show how to compute the Hermite form H of A and a unimodular matrix U such that UA = H . The algorithm requires a polynomial number of
Algorithms for matrix canonical forms
Computing canonical forms of matrices over rings is a classical math¬ ematical problem with many applications to computational linear alge¬ bra. These forms include the Frobenius form over a field,
NC2 computation of gcd-free basis and application to parallel algebraic numbers computation
We establish that the problem of computing a gcd-free basis for a set of polynomials is in AfC~ for any arbitrary field F. This leads to a proof that arithmetic for a simple algebraic extension is in
Asymptotically fast triangulation of matrices over rings
This paper shows how to apply fast matrix multiplication techniques to the problem of triangularizing a matrix over a ring using elementary column operations to lead to an algorithm for triangularizing integer matrices that has a faster running time than the known Hermite normal form algorithms.
Hermite form computation of matrices of differential polynomials
The Hermite form H of A is computed by reducing the problem to solving a linear system of equations over F(t), which requires a polynomial number of operations in F in terms of the input sizes: n, degDA, and degtA.


Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
Recently, Frumkin [9] pointed out that none of the well-known algorithms that transform an integer matrix into Smith [16] or Hermite [12] normal form is known to be polynomially bounded in its runn...
Fast parallel matrix and GCD computations
Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines
Solving Systems of Linear Equations over Polynomials
  • R. Kannan
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 1985
Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal Form of polynomial matrices
The method employs randomization as a tool to remove the iterations along the main diagonal in the classical sequential algorithms, and as such might be useful in similar settings, as well as may speed the sequential methods themselves.
I. On systems of linear indeterminate equations and congruences
  • H. Smith
  • Mathematics
    Proceedings of the Royal Society of London
  • 1862
The present communication relates to the theory of the solution, in positive and negative integral numbers, of systems of linear indeterminate equations, having integral coefficients. In connexion
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
It is shown that the rank of a matrix over an arbitrary field can be computed inO(log2n) time using a polynomial number of processors.
Exact reduction of a polynomial matrix to the Smith normal form
A finite field transform method is described for the exact reduction of a single-variable polynomial matrix to its Smith form, without the accompanying problem of coefficient growth.
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Vanous fast probabdlsttc algonthms, with probability of correctness guaranteed a prion, are presented for testing polynomial ldentmes and propemes of systems of polynomials and ancdlary fast algorithms for calculating resultants and Sturm sequences are given.