Advertisement

Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal form of polynomial matrices

  • Erich Kaltofen
  • M. S. Krishnamoorthy
  • B. David Saunders
Polynomial Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 378)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chou, T. J. and Collins, G. E., “Algorithms for the solution of systems of diophantine linear equations,” SIAM J. Comp., vol. 11, pp. 687–708, 1982.CrossRefGoogle Scholar
  2. 2.
    Cook, S. A., “A taxonomy of problems with fast parallel algorithms,” Inf. Control, vol. 64, pp. 2–22, 1985.CrossRefGoogle Scholar
  3. 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. 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. 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
  6. 6.
    Kannan, R., “Polynomial-time algorithms for solving systems of linear equations over polynomials,” Theoretical Comp. Sci., vol. 39, pp. 69–88, 1985.CrossRefGoogle Scholar
  7. 7.
    Kannan, R. and Bachem, A., “Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix,” SIAM J. Comp., vol. 8, pp. 499–507, 1981.CrossRefGoogle Scholar
  8. 8.
    MacDuffee, C. C., Vectors and Matrices, Math. Assoc. America, 1943.Google Scholar
  9. 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
  10. 10.
    Schwartz, J. T., “Fast probabilistic algorithms for verification of polynomial identities,” J. ACM, vol. 27, pp. 701–717, 1980.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Erich Kaltofen
    • 1
  • M. S. Krishnamoorthy
    • 1
  • B. David Saunders
    • 2
  1. 1.Department of Computer ScienceRensselaer Polytechnic InstituteTroy
  2. 2.Department of Computer and Information SciencesUniversity of DelawareNewark

Personalised recommendations