Faster inversion and other black box matrix computations using efficient block projections

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

Volumn , Issue , 2007, Pages 143-150

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

^a UNIVERSITY OF CALGARY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIVERSITÉ DE LYON   (France)

^d UNIVERSITÉ DE PERPIGNAN   (France)

Author keywords

Black box linear algebra; Linear system solving; Sparse integer matrix; Structured integer matrix

Indexed keywords

COMPUTATIONAL METHODS; INTEGER PROGRAMMING; LINEAR SYSTEMS; PROBLEM SOLVING;

BLACK BOX LINEAR ALGEBRA; LINEAR SYSTEM SOLVING; SPARSE INTEGER MATRIX; STRUCTURED INTEGER MATRIX;

MATRIX ALGEBRA;

EID: 36349009278     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1277548.1277569     Document Type: Conference Paper

References (23)

1. B. Beckermann and G. Labahn. A uniform approach for the fast computation of matrix-type Padé approximants. SIAM J. Matrix Anal. Appl., 15(3):804-823, July 1994.
2. A. Bostan and E. Schost. Polynomial evaluation and interpolation on special sets of points. J. Complex., 21(4):420-446, 2005.
3. D. Cantor and E. Kaltofen. Fast multiplication of polynomials over arbitrary algebras. Acta Informatica, 28:693-701, 1991.
4. 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.
5. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symb. Comp., 9:251-280, 1990.
6. John 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 Arjeh M. Cohen, Xiao-Shan Gao, and Nobuki Takayama, editors, Proceedings of the 2002 International Congress of Mathematical Software, Beijing, China, pages 40-50. World Scientific, August 2002.
8. J.-G. Dumas, B. D. Saunders, and G. Villard. Integer Smith form via the valence: experience with large sparse matrices from homology. In ISSAC '00: Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, pages 95-105, New York, NY, USA, 2000. ACM Press.
9. W. Eberly. Processor-efficient parallel matrix inversion over abstract fields: two extensions. In Proceedings, PASCO '97, pages 38-45, New York, NY, USA, 1997. ACM Press.
10. W. Eberly, M. Giesbrecht, P. Giorgi, A. Storjohann, and G. Villard. Solving sparse rational linear systems. In ISSAC '06: Proceedings of the 2006 International Symposium on Symbolic and algebraic computation, pages 63-70, New York, NY, USA, 2006. ACM Press.
11. I. Z. Emiris and V. Y. Pan. Improved algorithms for computing determinants and resultants. J. Complex., 21(1):43-71, 2005.
12. M. Giesbrecht. Efficient parallel solution of sparse systems of linear diophantine equations. In Proceediings, PASCO'97, pages 1-10, 1997.
13. M. Giesbrecht. Fast computation of the Smith form of a sparse integer matrix. Computational Complexity, 10(1):41-69, 2004.
14. P. Giorgi, C.-P. Jeannerod, and G. Villard. On the complexity of polynomial matrix computations. In Rafael Sendra, editor, Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation, Philadelphia, Pennsylvania, USA, pages 135-142. ACM Press, New York, August 2003.
15. X. Huang and V. Y. Pan. Fast rectangular matrix multiplication and applications. J. Complex., 14(2):257-299, 1998.
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, April 1995.
17. E. Kaltofen and B. D. Saunders. On Wiedemann's method of solving sparse linear systems. In Proc. AAECC-9, volume 539 of Springer Lecture Notes in Comp. Sci., 1991. 29-38.
18. E. Kaltofen and G. Villard. On the complexity of computing determinants. Computational Complexity, 13(3-4):91-130, 2004.
19. 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.
20. V. Y. Pan, B. Murphy, R. E. Rosholt, and X. Wang. Toeplitz and Hankel meet Hensel and Newton: Nearly optimal algorithms and their practical acceleration with saturated initialization. Technical Report 2004 013, The Graduate Center, CUNY, New York, 2004.
21. J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. J. Assoc. Computing Machinery, 27:701-717, 1980.
22. D. H. Wiedemann. Solving sparse linear equations over finite fields. IEEE Transactions on Information Theory, 32(1):54-62, January 1986.
23. R. Zippel. Probabilistic algorithms for sparse polynomials. In Proc. EUROSAM 79, pages 216-226, Marseille, 1979.