Description of fast matrix multiplication algorithm: ⟨21 × 21 × 24:5880⟩
Algorithm type
[[1, 3, 3]$1632,[1, 3, 6]$24,[1, 6, 6]$120,[2, 3, 3]$1376,[2, 3, 6]$40,[2, 6, 6]$848,[3, 3, 3]$384,[3, 6, 3]$48,[3, 6, 6]$48,[3, 9, 9]$24,[3, 9, 12]$48,[3, 12, 9]$48,[4, 3, 3]$192,[4, 3, 6]$16,[4, 6, 6]$560,[4, 12, 12]$24,[6, 3, 3]$256,[6, 6, 3]$32,[6, 6, 6]$32,[6, 9, 9]$16,[6, 9, 12]$32,[6, 12, 9]$32,[8, 6, 6]$32,[8, 12, 12]$16]Algorithm definition
The algorithm ⟨21 × 21 × 24:5880⟩ is the (Kronecker) tensor product of ⟨3 × 3 × 6:40⟩ with ⟨7 × 7 × 4:147⟩.
Algorithm description
These encodings are given in compressed text format using the maple computer algebra system. In each cases, the last line could be understood as a description of the encoding with respect to classical matrix multiplication algorithm. As these outputs are structured, one can construct easily a parser to its favorite format using the maple documentation without this software.
Back to main table