Description of fast matrix multiplication algorithm: ⟨15 × 24 × 24:4880⟩
Algorithm type
[[1, 3, 3]$1728,[1, 6, 6]$48,[2, 3, 3]$1152,[2, 6, 3]$24,[2, 6, 6]$680,[3, 3, 3]$288,[3, 12, 9]$24,[3, 12, 12]$24,[4, 6, 3]$16,[4, 6, 6]$432,[4, 12, 9]$24,[4, 12, 12]$24,[5, 6, 3]$24,[5, 6, 6]$72,[6, 3, 3]$192,[6, 12, 9]$16,[6, 12, 12]$16,[8, 12, 9]$16,[8, 12, 12]$16,[10, 6, 3]$16,[10, 6, 6]$48]Algorithm definition
The algorithm ⟨15 × 24 × 24:4880⟩ is the (Kronecker) tensor product of ⟨3 × 3 × 6:40⟩ with ⟨5 × 8 × 4:122⟩.
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