Description of fast matrix multiplication algorithm: ⟨15 × 24 × 30:6080⟩

Algorithm type

[[1, 3, 3]$1608,[1, 3, 9]$24,[1, 6, 3]$96,[1, 6, 6]$24,[1, 9, 3]$288,[1, 15, 3]$24,[2, 3, 3]$1168,[2, 3, 6]$24,[2, 3, 9]$16,[2, 6, 3]$112,[2, 6, 6]$736,[2, 6, 12]$24,[2, 9, 3]$192,[2, 12, 6]$48,[2, 15, 3]$16,[2, 15, 6]$24,[3, 3, 3]$288,[3, 9, 3]$48,[3, 9, 6]$96,[3, 12, 9]$24,[4, 3, 3]$64,[4, 3, 6]$16,[4, 6, 3]$32,[4, 6, 6]$528,[4, 6, 12]$16,[4, 9, 9]$24,[4, 12, 6]$32,[4, 12, 12]$24,[4, 15, 6]$16,[5, 3, 3]$24,[5, 6, 6]$24,[6, 3, 3]$192,[6, 9, 3]$32,[6, 9, 6]$64,[6, 12, 9]$16,[8, 6, 6]$32,[8, 9, 9]$16,[8, 12, 12]$16,[10, 3, 3]$16,[10, 6, 6]$16]

Algorithm definition

The algorithm ⟨15 × 24 × 30:6080⟩ is the (Kronecker) tensor product of ⟨3 × 3 × 6:40⟩ with ⟨5 × 8 × 5:152⟩.

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