Description of fast matrix multiplication algorithm: ⟨24 × 30 × 30:11200⟩
Algorithm type
[[3, 1, 3]$2304,[3, 2, 3]$2976,[3, 3, 3]$576,[3, 4, 3]$960,[3, 6, 3]$384,[6, 2, 6]$1824,[6, 4, 6]$1456,[6, 6, 6]$96,[6, 8, 6]$160,[6, 12, 6]$64,[12, 4, 12]$240,[12, 8, 12]$160]Algorithm definition
The algorithm ⟨24 × 30 × 30:11200⟩ is the (Kronecker) tensor product of ⟨2 × 5 × 5:40⟩ with ⟨12 × 6 × 6:280⟩.
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