Algorithms for Large Integer Matrix Problems

  • Mark Giesbrecht
  • Michael Jr. Jacobson
  • Arne Storjohann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2227)

Abstract

New algorithms are described and analysed for solving various problems associated with a large integer matrix: computing the Hermite form, computing a kernel basis, and solving a system of linear diophantine equations. The algorithms are space-efficient and for certain types of input matrices — for example, those arising during the computation of class groups and regulators — are faster than previous methods. Experiments with a prototype implementation support the running time analyses.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    H. Cohen and H. Lenstra, Jr. Heuristics on class groups of number fields. In Number Theory, Lecture notes in Math., volume 1068, pages 33–62. Springer-Verlag, New York, 1983.Google Scholar
  2. 2.
    J. D. Dixon. Exact solution of linear equations using p-adic expansions. Numer. Math., 40:137–141, 1982.MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    P. D. Domich, R. Kannan, and L. E. Trotter, Jr. Hermite normal form computation using modulo determinant arithmetic. Mathematics of Operations Research, 12(1):50–59, 1987.MATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    J. L. Hafner and K. S. McCurley. A rigorous subexponential algorithm for computation of class groups. J. Amer. Math. Soc., 2:837–850, 1989.MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    C. S. Iliopoulos. 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. SIAM Journal of Computing, 18(4):658–669, 1989.MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    H. Iwaniec. On the problem of Jacobsthal. Demonstratio Mathematica, 11(1):225–231, 1978.MATHMathSciNetGoogle Scholar
  7. 7.
    M. J. Jacobson, Jr. Subexponential Class Group Computation in Quadratic Orders. PhD thesis, Technischen Universität Darmstadt, 1999.Google Scholar
  8. 8.
    F. Lübeck. On the computation of elementary divisors of integer matrices. Journal of Symbolic Computation, 2001. To appear.Google Scholar
  9. 9.
    T. Mulders and A. Storjohann. Diophantine linear system solving. In S. Dooley, editor, Proc. Int’l. Symp. on Symbolic and Algebraic Computation: ISSAC’ 99, pages 281–288. ACM Press, 1999.Google Scholar
  10. 10.
    T. Mulders and A. Storjohann. Rational solutions of singular linear systems. In C. Traverso, editor, Proc. Int’l. Symp. on Symbolic and Algebraic Computation: ISSAC’ 00, pages 242–249. ACM Press, 2000.Google Scholar
  11. 11.
    A. Storjohann. A solution to the extended gcd problem with applications. In W. W. Küchlin, editor, Proc. Int’l. Symp. on Symbolic and Algebraic Computation: ISSAC’ 97, pages 109–116. ACM Press, 1997.Google Scholar
  12. 12.
    A. Storjohann. Algorithms for Matrix Canonical Forms. PhD thesis, ETH-Swiss Federal Institute of Technology, 2000.Google Scholar
  13. 13.
    J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 1999.Google Scholar
  14. 14.
    D. Wiedemann. Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theory, IT-32:54–62, 1986.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Mark Giesbrecht
    • 1
  • Michael Jr. Jacobson
    • 2
  • Arne Storjohann
    • 1
  1. 1.Ontario Research Centre for Computer AlgebraUniversity of Western OntarioLondonCanada
  2. 2.Dept. of Computer ScienceUniversity of ManitobaWinnipegCanada

Personalised recommendations