A noncommutative algorithm for multiplying 5\(\times 5\) matrices using 102 multiplications (Q1819890)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A noncommutative algorithm for multiplying 5\(\times 5\) matrices using 102 multiplications |
scientific article; zbMATH DE number 3994905
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A noncommutative algorithm for multiplying 5\(\times 5\) matrices using 102 multiplications |
scientific article; zbMATH DE number 3994905 |
Statements
A noncommutative algorithm for multiplying 5\(\times 5\) matrices using 102 multiplications (English)
0 references
1986
0 references
Consider a (m,n,p) product as the problem of multiplying an \(m\times n\) matrix by an \(n\times p\) matrix. Decomposing a (5,5,5) product into (5,2,5), (3,2,5) and (3,5,3) products by \textit{R. L. Probert} and \textit{P. C. Fischer} [Util. Math. 18, 257-267 (1980; Zbl 0471.68025)] an algorithm for the (3,5,3) product using 37 multiplications is given.
0 references
matrix multiplication
0 references
complexity of computation
0 references
fast noncommutative algorithms
0 references
