Parallel algorithms for matrix normal forms (Q803724): Difference between revisions

In this paper, which is the third in a series of papers [the authors and \textit{B. D. Saunders}, Proc. ACM Symp. on Symbolic Algebraic Computation 1986, 65-70 (1986) and SIAM J. Algebraic Discrete Methods 8, 683-690 (1987; Zbl 0655.65069)] the authors describe a new randomized parallel algorithm that determines the Smith normal form of a matrix with entries being univariate polynomials with coefficients in an arbitrary field. The algorithm reduces the problem of Smith normal form computations to two Hermite form computations. Fast parallel algorithms for the Jordan normal form of a given matrix are also given.