New combinations of methods for the acceleration of matrix multiplications
- 1 January 1981
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 7 (1) , 73-125
- https://doi.org/10.1016/0898-1221(81)90009-2
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- O(n2.7799) complexity for n × n approximate matrix multiplicationPublished by Elsevier ,2002
- On multiplication in algebraic extension fieldsTheoretical Computer Science, 1979
- Algebras Having Linear Multiplicative ComplexitiesJournal of the ACM, 1977
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear FormsSIAM Journal on Computing, 1973
- Boolean matrix multiplication and transitive closurePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1971
- On the number of multiplications necessary to compute certain functionsCommunications on Pure and Applied Mathematics, 1970
- Gaussian elimination is not optimalNumerische Mathematik, 1969