Fast Rectangular Matrix Multiplication and Applications

Journal of Complexity

Volumn 14, Issue 2, 1998, Pages 257-299

  Huang, Xiaohan ^a   Pan, Victor Y ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Rectangular matrix multiplication; asymptotic arithmetic complexity; bilinear algorithms; parallel complexity; polynomial composition; polynomial factorization over finite fields; linear programming

Indexed keywords

EID: 0000559550     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1998.0476     Document Type: Article

References (34)

1. Berlekamp E. R. Factoring polynomials over large finite fields. Math. Comput. 24:1970;713-735.
2. 2.7799. Inform. Process. Lett. 8:1979;234-235.
3. Bürgisser P., Clausen M., Shokrollahi M. A. Algebraic Computational Complexity. 1997;Springer, Berlin.
4. Brockett R. W., Dobkin D. On the number of multiplications required for matrix multiplications. SIAM J. Complexity. 5:1976;624-628.
5. Behrend F. A. On sets of integers which contain no three terms in arithmetical progression. Proc. Nat. Acad. Sci. USA. 32:1946;331-332.
6. Brent R. P., Kung H. T. Fast algorithms for manipulating formal power series. J. Assoc. Comput. Mach. 25:1978;581-595.
7. Borodin A., Munro I. The Computational Complexity of Algebraic and Numeric Problems. 1975;American Elsevier, New York.
8. Beling P. A., Megiddo N. Using fast matrix multiplication to find basic solutions. Theoret. Comput. Sci. 1998.
9. Bini D., Pan V. Y. Polynomial and Matrix Computations, Vol. 1: Fundamental Algorithms. 1994;Birkhäuser, Boston.
10. Coppersmith D. Rapid multiplication of rectangular matrices. SIAM J. Comput. 11:1982;467-471.
11. Coppersmith D. Rectangular matrix multiplication revisited. J. Complexity. 13:1997;42-49.
12. Coppersmith D., Winograd S. On the asymptotic complexity of matrix multiplication. SIAM J. Comput. 11:1982;472-492.
13. Coppersmith D., Winograd S. Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9:1990;251-280.
14. Cantor D. G., Zassenhaus H. A new algorithm for factoring polynomials over finite fields. Math. Comput. 36:1981;587-592.
15. Eberly W. Parallel matrix inversion over abstract fields: Two approaches. Proceedings Second International Symposium on Parallel Symbolic Computation (PASCO'97). 1997;ACM Press, New York. p. 38-45.
16. Eppstein D., Galil Z. Parallel algorithmic techniques for combinatorial computation. Annual Rev. Comput. Sci. 3:1988;233-283.
17. Golub G. H., Van Loan C. F. Matrix Computations. 1996;Johns Hopkins Univ. Press, Baltimore.
18. Galil Z., Pan V. Y. Parallel evaluation of the determinant and of the inverse of a matrix. Infor. Proc. Lett. 30:1989;41-45.
19. von zur Gathen J., Shoup V. Computing Frobenius maps and factoring polynomials. Comput. Complexity. 2:1992;187-224.
20. Kaltofen E., Pan V. Y. Processor efficient parallel solution of linear systems over an abstract field. Proceedings, 3rd Annual ACM Symposium on Parallel Algorithms and Architectures. 1991;ACM Press, New York. p. 180-191.
21. Kaltofen E., Pan V. Y. Processor-efficient parallel solution of linear systems. II. The positive characteristic and singular case. Proceedings of 33rd Annual IEEE Symposium on Foundations of Computer Science. 1992;IEEE Computer Society Press, Los Alamitos. p. 714-723.
22. Kaltofen E., Pan V. Y. Parallel solution of Toeplitz and Toeplitz-like linear systems over fields of small positive characteristic. Proceedings of First International Symposium on Parallel Symbolic Computation (PASCO'94), Linz, Austria (Sept. 1994). Lecture Notes Series in Computing. 5:1994;World Scientific, Singapore. p. 225-233.
23. Karp R., Ramachandran V. A survey of parallel algorithms for shared memory machines. Handbook for Theoretical Computer Science. 1990;North Holland, Amsterdam. p. 869-941.
24. Kaltofen E., Shoup V. Subquadratic-time factoring of polynomials over finite fields. Proceedings, 27th Annual ACM Symposium on Theory Comput. 1995;ACM Press, New York. p. 398-406.
25. Pan V. Y. On schemes for the computation of products and inverses of matrices. Uspekhi Mat. Nauk. 27:1972;249-250.
26. Pan V. Y. How to Multiply Matrices Faster. Lecture Notes in Computer Science. 179:1984;Springer, Berlin.
27. Pan V. Y. How can we speed-up matrix multiplication? SIAM Rev. 26:1984;393-415.
28. Pan V. Y. Parallel computation of polynomial GCD and some related parallel computations over abstract fields. Theor. Comput. Sci. 162:1996;173-233.
29. Schönhage A. Partial and total matrix multiplication. SIAM J. Comput. 10:1981;434-456.
30. Salem R., Spencer D. C. On sets of integers which contain no three terms in arithmetical progression. Proc. Nat. Acad. Sci. USA. 28:1942;561-563.
31. Strassen V. Gaussian elimination is not optimal. Numerische Math. 13:1969;354-356.
32. Strassen V. The asymptotic spectrum of tensors and the exponent of matrix multiplication. Proceedings, 27th Annual IEEE Symposium on Foundations of Computer Science. 1986;IEEE Computer Society Press. p. 49-54.
33. Strassen V. Relative bilinear complexity and matrix multiplication. J. Reine Angew. Math. 375/376:1987;406-443.
34. Strassen V. The asymptotic spectrum of tensor. J. Reine Angew. Math. 384:1988;102-152.