A BLAS based C library for exact linear algebra on integer matrices

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn 2005, Issue , 2005, Pages 92-99

  Chen, Zhuliang ^a   Storjohann, Arne ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Integer matrix; Linear system solving

Indexed keywords

DIGITAL ARITHMETIC; INTEGER PROGRAMMING; LINEAR ALGEBRA; LINEAR SYSTEMS; MATRIX ALGEBRA; NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING;

GNU MULTIPLE PRECISION LIBRARY (GMP); INTEGER MATRICES; LINEAR SYSTEM SOLVING;

LIBRARIES;

EID: 21844436353     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073884.1073899     Document Type: Conference Paper

References (29)

1. J. Abbott, M. Bronstein, and T. Mulders. Fast deterministic computation of determinants of dense matrices. In S. Dooley, editor, Proc. Int'l. Symp, on Symbolic and Algebraic Computation: ISSAC '99, pages 197-204. ACM Press, New York, 1999.
2. J. Abbott and T. Mulders. How tight is Hadamard's bound? Experimental Mathematics, 10(3):331-336, 2001.
3. S. Cabay. Exact solution of linear systems. In Proc. Second Symp. on Symbolic and Algebraic Manipulation, pages 248-253, 1971.
4. Z. Chen. A BLAS based C library for exact linear algebra on integer matrices. Master's thesis, School of Computer Science, University of Waterloo, 2005.
5. J. D. Dixon. Exact solution of linear equations using p-adic expansions. Numer. Math., 40:137-141, 1982.
6. J.-G. Dumas. Efficient dot product over word-size finite fields. CoRR, cs.SC/0404008, 2004.
7. J.-G. Dumas, T. Gautier, M. Giesbrecht, P. Giorgi, B. Hovinen, E. Kultofen, B. D. Saunders, W. J. Turner, and V. G. LinBox: A generic library for exact linear algebra. In A. J. Cohen and N. Gao, X.-S. andl Takayama, editors, Proc. First Internat. Congress Math. Software ICMS 2002, Beijing, China, pages 40-50, Singapore, 2002. World Scientific.
8. J. G. Dumas, T. Gautier, and C. Pernet. Finite field linear algebra subroutines. In Proc. Int'l. Symp. on Symbolic and Algebraic Computation: ISSAC '02, pages 63-74. ACM Press, New York, 2002.
9. J. G. Dumas, P. Giorgi, and C. Pernet. Finite field linear algebra package. In J. Gutierrez, editor, Proc. Int'l. Symp. on Symbolic and Algebraic Computation: ISSAC '04, pages 119-126. ACM Press, New York, 2004.
10. W. Eberly, M. Giesbrecht, and G. Villard. Computing the determinant and Smith form of an integer matrix. In Proc. 31st Ann. IEEE Symp. Foundations of Computer Science, pages 675-685, 2000.
11. J. Edmonds and R. Giles. A min-max relation for submodular functions on graphs. Annals of Discrete Mathematics, 1:185-204, 1977.
12. J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press,.2 edition, 2003.
13. M. Giesbrecht. Efficient parallel solution of sparse systems of linear diophantine equations. In M. Hitz and E. Kaltofen, editors, Second Int'l Symp. on Parallel Symbolic Computation: PASCO '97, pages 1-10. ACM Press, New York, 1997.
14. M. Giesbrecht, A. Lobo, and B. D. Saunders, Certifying inconsistency of sparse linear systems. In O. Gloor, editor, Proc. Int'l. Symp. on Symbolic and Algebraic Computation: ISSAC '98, pages 113-119. ACM Press, New York, 1998.
15. P. Giorgi. Arithmetic and algorithmic in exact linear algebra for the LinBox library. PhD thesis, Ecole normale superieure de Lyon, LIP, Lyon, France, December 2004.
16. T. Granlund. The GNU multiple precision arithmetic library, 2004. Edition 4.1.4. http://www.swox.com/gmp.
17. 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.
18. A. K. Lenstra, H. W. Lenstra, and L. Lovász. Factoring polynomials with rational coefficients. Math. Ann., 261:515-534, 1982.
19. R. T. Moenck and J. H. Carter. Approximate algorithms to derive exact solutions to systems of linear equations. In Proc. EUROSAM '79, volume 72 of Lecture Notes in Compute Science, pages 65-72, Berlin-Heidelberg-New York, 1979. Springer-Verlag.
20. 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, New York, 1999.
21. T. Mulders and A. Storjohann. Certified dense linear system solving. Journal of Symbolic Computation, 37(4):485-510, 2004.
22. P. Nguyen and D. Stehlé. Floating-point LLL revisited. In Proceedings of Eurocrypt '05, 2005.
23. D. Saunders and Z. Wan. Smith normal form of dense integer matrices, fast algorithms into practice. In J. Gutierrez, editor, Proc. Int'l. Symp. on Symbolic and Algebraic Computation: ISSAC '04, pages 274-281. ACM Press, New York, 2004.
24. V. Shoup. NTL: A Library for Doing Number Theory, 2005. http://www.shoup.net/ntl/.
25. C. C. Sims. Computation with finitely presented groups, volume 48 of Encyclopedia of mathematics and its applications. Cambridge University Press, 1984.
26. A. Storjohann. Faster algorithms for integer lattice basis reduction. Technical Report 249, Departement Informatik, ETH Zürich, July 1996.
27. A. Storjohann. Algorithms for Matrix Canonical Forms. PhD thesis, Swiss Federal Institute of Technology, ETH-Zurich, 2000.
28. U. Vollmer. A note on the Hermite basis computation of large integer matrices. In R. Sendra, editor, Proc. Int'l. Symp. on Symbolic and Algebraic Computation: ISSAC '03, pages 255-257. ACM Press, New York, 2003.
29. R. C. Whaley, A. Petitet, and J. J. Dongarra, Automated empirical optimization of software and the atlas project, Parallel Computing, 27(1-2), 2001.