How Can We Speed Up Matrix Multiplication?
- 1 July 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 26 (3) , 393-415
- https://doi.org/10.1137/1026076
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- O(n2.7799) complexity for n × n approximate matrix multiplicationPublished by Elsevier ,2002
- On the Asymptotic Complexity of Matrix MultiplicationSIAM Journal on Computing, 1982
- Some Properties of Disjoint Sums of Tensors Related to Matrix MultiplicationSIAM Journal on Computing, 1982
- New combinations of methods for the acceleration of matrix multiplicationsComputers & Mathematics with Applications, 1981
- New Fast Algorithms for Matrix OperationsSIAM Journal on Computing, 1980
- Methods of aggregationLinear Algebra and its Applications, 1980
- Relations between exact and approximate bilinear algorithms. ApplicationsCalcolo, 1980
- Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplicationsBulletin of the American Mathematical Society, 1976
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear FormsSIAM Journal on Computing, 1973