Description of fast matrix multiplication algorithm: ⟨21 × 24 × 27:7520⟩
Algorithm type
[[3, 3, 1]$1968,[3, 3, 2]$1984,[3, 3, 3]$288,[3, 3, 4]$472,[3, 3, 6]$192,[3, 3, 8]$16,[6, 6, 1]$168,[6, 6, 2]$1144,[6, 6, 4]$760,[6, 6, 5]$48,[6, 6, 6]$48,[6, 6, 8]$48,[6, 6, 10]$32,[6, 6, 12]$32,[9, 9, 2]$48,[9, 9, 3]$24,[9, 9, 4]$32,[9, 9, 6]$16,[12, 12, 2]$24,[12, 12, 3]$24,[12, 12, 4]$88,[12, 12, 6]$16,[12, 12, 8]$48]Algorithm definition
The algorithm ⟨21 × 24 × 27:7520⟩ is the (Kronecker) tensor product of ⟨3 × 6 × 3:40⟩ with ⟨7 × 4 × 9:188⟩.
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