New Fast Algorithms for Matrix Operations
- 1 May 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 9 (2) , 321-342
- https://doi.org/10.1137/0209027
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- 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 5×5 matrices using 103 multiplicationsInformation Processing Letters, 1978
- On the optimal evaluation of a set of bilinear formsLinear Algebra and its Applications, 1978
- Addition Requirements for Rational FunctionsSIAM Journal on Computing, 1977
- On the Number of Multiplications Required for Matrix MultiplicationSIAM Journal on Computing, 1976
- 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
- On Obtaining Upper Bounds on the Complexity of Matrix MultiplicationPublished by Springer Nature ,1972
- Sur le calcul des produits de matricesNumerische Mathematik, 1971
- On Minimizing the Number of Multiplications Necessary for Matrix MultiplicationSIAM Journal on Applied Mathematics, 1971