Description of fast matrix multiplication algorithm: ⟨14 × 24 × 24:4620⟩

Algorithm type

[[1, 1, 1]$648,[1, 2, 1]$654,[1, 2, 2]$18,[1, 3, 3]$864,[1, 4, 1]$6,[1, 4, 2]$18,[2, 2, 1]$18,[2, 2, 2]$714,[2, 3, 3]$576,[2, 4, 1]$18,[2, 4, 2]$391,[2, 4, 4]$3,[2, 6, 6]$144,[2, 8, 2]$1,[2, 8, 4]$3,[3, 4, 3]$24,[3, 4, 4]$24,[3, 8, 3]$6,[3, 8, 4]$6,[4, 4, 2]$3,[4, 4, 3]$24,[4, 4, 4]$227,[4, 6, 6]$96,[4, 8, 2]$3,[4, 8, 3]$6,[4, 8, 4]$65,[6, 8, 6]$4,[6, 8, 8]$4,[6, 16, 6]$1,[6, 16, 8]$1,[7, 8, 7]$18,[8, 8, 6]$4,[8, 8, 8]$21,[8, 16, 6]$1,[8, 16, 8]$3,[14, 16, 14]$3]

Algorithm definition

The algorithm ⟨14 × 24 × 24:4620⟩ is the (Kronecker) tensor product of ⟨2 × 2 × 2:7⟩ with ⟨7 × 12 × 12:660⟩.

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