Implementation of Strassen's algorithm for matrix multiplication

Proceedings of the International Conference on Supercomputing

Volumn 1996-November, Issue , 1996, Pages

  Huss Lederman, Steven ^a   Jacobson, Elaine M ^b   Johnson, Jeremy R ^c   Tsao, Anna ^b   Turnbull, Thomas ^b  

^a University of Wisconsin Madison   (United States)

^b Center for Computing Sciences   (United States)

^c DREXEL UNIVERSITY   (United States)

Author keywords

Level 3 BLAS; Matrix multiplication; Strassen's algorithm; Winograd variant

Indexed keywords

CODES (SYMBOLS);

EFFICIENT IMPLEMENTATION; LEVEL-3 BLAS; MATRIX; MATRIX MULTIPLICATION; MATRIX MULTIPLICATION ALGORITHM; PERFORMANCE; PORTABLE IMPLEMENTATION; STRASSEN'S ALGORITHM; WINOGRAD; WINOGRAD VARIANT;

MATRIX ALGEBRA;

EID: 33947652414     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SUPERC.1996.183534     Document Type: Conference Paper

References (19)

1. E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov, and D. Sorensen. LAPACK Users' Guide. SIAM, Philadelphia, 1992.
2. D. H. Bailey. Extra high speed matrix multiplication on the Cray-2. SIAM J. Sci. Stat. Computing, 9:603-607, 1988.
3. D. H. Bailey, K. Lee, and H. D. Simon. Using Strassen's Algorithm to Accelerate the Solution of Linear Systems. Journal of Supercomputing, 4(5):357-371, 1990.
4. R. P. Brent. Algorithms for matrix multiplication. Technical report, Stanford University, 1970. Technical Report CS 157, (Available from National Technical Information Service, # AD705509).
5. J. Cohen and M. Roth. On the implementation of Strassen's fast multiplication algorithm. Acta Informatica, 6:341-355, 1976.
6. T. H. Gormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, Massachusetts, 1990.
7. J. J. Dongarra, J. Du Groz, S. Hammarling, and I. Duff. A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Software, 16:1-17, 1990.
8. G. Douglas, M. Heroux, G. Slishman, and R. M. Smith. GEMMW: A portable level 3 BLAS Winograd variant of Strassen's matrix-matrix multiply algorithm. Journal of Computational Physics, 110:1-10, 1994.
9. P. G. Fischer. Further schemes for combining matrix algorithms, in Automata, Languages and Programming, volume 14 of Lecture Notes in Computer Science, pages 428-436. Springer-Verlag, Berlin, 1974.
10. P. C. Fischer and R. L. Probert. Efficient procedures for using matrix algorithms, in Automata, Languages and Programming, volume 14 of Lecture Notes in Computer Science, pages 413-427. Springer-Verlag, Berlin, 1974.
11. N. J. Higham. Exploiting fast matrix multiplication within the level 3 BLAS. ACM Trans. Math. Software, 16:352-368, 1990.
12. N. J. Higham. Stability of block algorithms with fast level 3 BLAS. ACM Trans. Math. Software, 18:274-291, 1992.
13. J. E. Hopcroft and L. R. Kerr. Some techniques for proving certain simple programs optimal. In Proceedings, Tenth Annual Symposium on Switching and Automata Theory, pages 36-45, 1969.
14. S. Huss-Lederman, E. M. Jacobson, J. R. Johnson, A. Tsao, and T. Turnbull. Strassen's algorithm for matrix multiplication: Modeling, analysis, and implementation. Technical report, Center for Computing Sciences, 1996. Technical Report CCS-TR-96-147.
15. S. Huss-Lederman, A. Tsao, and T. Turnbull. A parallelizable eigensolver for real diagonalizable matrices with real eigenvalues. SIAM J. Sci. Computing, 18(2), 1997. (to appear).
16. I B M Engineering and Scientific Subroutine Library Guide and Reference, 1992. Order No. SC23-0526.
17. P. A. Knight. Fast rectangular matrix multiplication and QR decomposition. Linear Algebra Appi., 221:69-81, 1995.
18. R. L. Probert. On the additive complexity of matrix multiplication. SIAM Journal of Computing, 5(6):187-203, 1976.
19. V. Strassen. Gaussian elimination is not optimal. Numer. Math., 13:354-356, 1969.