Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
Erich Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders · SIAM Journal on Algebraic and Discrete Methods · 1987
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 the rational canonical form of matrices over finite fields and the field of rational numbers.