Ulrich Vollmer
ABSTRACT
A new algorithm is given and analyzed for the computation of the Hermite basis of a large integer matrix whose HNF has small essential part. The algorithm improves the results from [3] by dropping two key requirements on the matrix considered---sparsity and small kernel dimension---at the cost of relying on small determinant size.
- D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Comput., 9(3):251--280, 1990. Google Scholar
Digital Library
- J. D. Dixon. Exact solution of linear equations using $p$-adic expansions. Numer. Math., 40(1):137--141, 1982.Google ScholarCross Ref
- M. Giesbrecht, M. Jacobson, Jr., and A. Storjohann. Algorithms for large integer matrix problems. In Applied algebra, algebraic algorithms and error-correcting codes (Melbourne, 2001), volume 2227 of Lecture Notes in Comput. Sci., pages 297--307. Springer, Berlin, 2001. Google ScholarDigital Library
- J. Hafner and K. McCurley. Asymptotically fast triangularization of matrices over rings. SIAM J. Comput., 20:1068--1083, 1991. Google ScholarDigital Library
- T. Mulders and A. Storjohann. Diophantine linear system solving. ACM Press, 1999.Google ScholarDigital Library
- T. Mulders and A. Storjohann. Certified linear system solving. Technical report, ETH Zürich, 2000.Google Scholar
- A. Storjohann. Algorithms for Matrix Canonical Forms. PhD thesis, Swiss Federal Institute of Technology -- ETH, 2000.Google Scholar
- U. Vollmer. An accelerated Buchmann algorithm for regulator computation in real quadratic fields. In Algorithmic Number Theory, ANTS-V, volume 2369 of Lecture Notes in Computer Science, pages 148--162. Springer-Verlag, 2002. Google ScholarDigital Library
Index Terms
- A note on the hermite basis computation of large integer matrices
Recommendations
Efficient parallelizations of Hermite and Smith normal form algorithms
Hermite and Smith normal form are important forms of matrices used in linear algebra. These terms have many applications in group theory and number theory. As the entries of the matrix and of its corresponding transformation matrices can explode during ...
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix
A Las Vegas randomized algorithm is given to compute the Hermite normal form of a nonsingular integer matrix A of dimension n. The algorithm uses quadratic integer multiplication and cubic matrix multiplication and has running time bounded by O(n3 (log n +...
Comments