Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal form of polynomial matrices
We have provided a parallel solution for the well-known Smith normal form problem. Our 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.
Unable to display preview. Download preview PDF.
- 3.Iliopoulos, C. S., “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,” Manuscript, Purdue Univ., 1986.Google Scholar
- 4.Kaltofen, E., Krishnamoorthy, M. S., and Saunders, B. D., “Fast parallel algorithms for similarity of matrices,” Proc. 1986 ACM Symp. Symbolic Algebraic Comp., pp. 65–70, 1986.Google Scholar
- 5.Kaltofen, E., Krishnamoorthy, M. S., and Saunders, B. D., “Fast parallel computation of Hermite and Smith forms of polynomial matrices,” SIAM J. Alg. Discrete Meth., vol. 8, pp. 683–690, 1987.Google Scholar
- 8.MacDuffee, C. C., Vectors and Matrices, Math. Assoc. America, 1943.Google Scholar
- 9.Mulmuley, K., “A fast parallel algorithm to compute the rank of a matrix over an arbitrary field,” Combinatorica, vol. 7, pp. 101–104, 1987.Google Scholar