Solving sparse rational linear systems

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

Volumn 2006, Issue , 2006, Pages 63-70

  Eberly, Wayne ^a   Giesbrecht, Mark ^b   Giorgi, Pascal ^b   Storjohann, Arne ^b   Villard, Gilles ^c  

^a UNIVERSITY OF CALGARY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIV LYON   (France)

Author keywords

Linear system solving; Sparse integer matrix; Structured matrix

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; LEARNING SYSTEMS; LINEAR EQUATIONS; MATRIX ALGEBRA; PROBLEM SOLVING;

LINEAR SYSTEM SOLVING; SPARSE INTEGER MATRIX; STRUCTURED MATRIX;

LINEAR SYSTEMS;

EID: 33748964953     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1145768.1145785     Document Type: Conference Paper

References (27)

1. B. Beckermann and G. Labahn. A uniform approach for the fast, reliable computation of matrix-type padé approximants. SIAM J. Matrix Anal. Appl., 15:804-823, 1994.
2. D. Cantor and E. Kaltofen. Fast multiplication of polynomials over arbitrary algebras. Acta Informatica, 28:693-701, 1991.
3. L. Chen, W. Eberly, E. Kaltofen, B. D. Saunders, W. J. Turner, and G. Villard. Efficient matrix preconditioners for black box linear algebra. Linear Algebra and its Applications, 343-344:119-146, 2002.
4. Z. Chen and A. Storjohann. A BLAS based C library for exact linear algebra on integer matrices. In ISSAC '05: Proceedings of the 2005 international symposium on Symbolic and algebraic computation, pages 92-99, New York, NY, USA, 2005. ACM Press.
5. D. Coppersmith. Solving homogeneous linear equations over GF[2] via block Wiedemann algorithm. Mathematics of Computation, 62(205):333-350, Jan. 1994.
6. J. D. Dixon. Exact solution of linear equations using p-adic expansions. Numerische Mathematik, 40:137-141, 1982.
7. J.-G. Dumas, T. Gautier, M. Giesbrecht, P. Giorgi, B. Hovinen, E. Kaltofen, B. D. Saunders, W. J. Turner, and G. Villard. LinBox: A generic library for exact linear algebra. In A. M. Cohen, X.-S. Gao, and N. Takayama, editors, Proceedings of the 2002 International Congress of Mathematical Software, Beijing, China, pages 40-50. World Scientific, Aug. 2002.
8. J.-G. Dumas, P. Giorgi, and C. Pernet. FFPACK: Finite field linear algebra package. In Gutierrez [14], pages 63-74.
9. W. Eberly, M. Giesbrecht, and G. Villard. On computing the determinant and Smith form of an integer matrix. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, page 675. IEEE Computer Society, 2000.
10. W. Eberly and E. Kaltofen. On randomized Lanczos algorithms. In W. Küchlin, editor, Proc. 1997 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'97), pages 176-183, New York, N. Y., 1997. ACM Press.
11. J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, New York, USA, 1999.
12. M. Giesbrecht. Efficient parallel solution of sparse systems of linear diophantine equations. In Parallel Symbolic Computation (PASCO'97), pages 1-10, Maui, Hawaii, July 1997.
13. P. Giorgi, C.-P. Jeannerod, and G. Villard. On the complexity of polynomial matrix computations. In R. Sendra, editor, Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation, Philadelphia, Pennsylvania, USA, pages 135-142. ACM Press, New York, Aug. 2003.
14. J. Gutierrez, editor. ISSAC'2004. Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, Santander, Spain. ACM Press, New York, July 2004.
15. G. H. Hardy and E. M. Wright. An Introduction to the Theory of Numbers. Oxford University Press, fifth edition, 1979.
16. E. Kaltofen. Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems. Mathematics of Computation, 64(210):777-806, Apr. 1995.
17. E. Kaltofen and B. D. Saunders. On Wiedemann's method of solving sparse linear systems. In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC '91), volume 539 of LNCS, pages 29-38, Oct. 1991.
18. G. Labahn, D. K. Chio, and S. Cabay. The inverses of block hankel and block toeplitz matrices. SIAM J. Comput., 19(1):98-123, 1990.
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 Computer Science, pages 65-72, Berlin-Heidelberg-New York, 1979. Springer-Verlag.
20. T. Mulders and A. Storjohann. Diophantine linear system solving. In International Symposium on Symbolic and Algebraic Computation (ISSAC 99), pages 181-188, Vancouver, BC, Canada, July 1999.
21. T. Mulders and A. Storjohann. Certified dense linear system solving. Journal of Symbolic Computation, 37(4):485-510, 2004.
22. B. D. Saunders and Z. Wan. Smith normal form of dense integer matrices, fast algorithms into practice. In Gutierrez [14].
23. A. Storjohann. The shifted number system for fast linear algebra on integer matrices. Journal of Complexity, 21(4):609-650, 2005.
24. W. J. Turner. Black Box Linear Algebra with Unbox Library. PhD thesis, North Carolina State University, May 2002.
25. G. Villard. A study of Coppersmith's block Wiedemann algorithm using matrix polynomials. Technical Report 975-IM, LMC/IMAG, Apr. 1997.
26. P. S. Wang. A p-adic algorithm for univariate partial fractions. In Proceedings of the fourth ACM symposium on Symbolic and algebraic computation, pages 212-217. ACM Press, 1981.
27. D. H. Wiedemann. Solving sparse linear equations over finite fields. IEEE Transactions on Information Theory, 32(1):54-62, Jan. 1986.