Description of fast matrix multiplication algorithm: ⟨21 × 24 × 24:6560⟩
Algorithm type
[[1, 3, 3]$1872,[1, 6, 3]$24,[1, 6, 6]$72,[2, 3, 3]$1680,[2, 6, 3]$40,[2, 6, 6]$984,[3, 3, 3]$288,[3, 12, 9]$72,[4, 3, 3]$288,[4, 6, 3]$16,[4, 6, 6]$768,[4, 12, 12]$72,[6, 3, 3]$192,[6, 12, 9]$48,[8, 6, 6]$96,[8, 12, 12]$48]Algorithm definition
The algorithm ⟨21 × 24 × 24:6560⟩ is the (Kronecker) tensor product of ⟨3 × 3 × 6:40⟩ with ⟨7 × 8 × 4:164⟩.
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