Description of fast matrix multiplication algorithm: ⟨14 × 32 × 32:8060⟩

Algorithm type

[[1, 1, 1]$1638,[1, 1, 2]$42,[1, 1, 3]$126,[1, 2, 1]$1178,[1, 2, 2]$144,[1, 2, 3]$54,[1, 3, 1]$84,[1, 4, 1]$204,[1, 4, 2]$54,[1, 6, 1]$36,[2, 1, 1]$42,[2, 2, 1]$144,[2, 2, 2]$2032,[2, 2, 4]$18,[2, 2, 6]$54,[2, 4, 1]$54,[2, 4, 2]$774,[2, 4, 4]$54,[2, 6, 2]$36,[3, 1, 1]$126,[3, 2, 1]$54,[3, 4, 3]$28,[3, 4, 4]$28,[3, 8, 3]$12,[3, 8, 4]$12,[4, 2, 2]$18,[4, 4, 2]$54,[4, 4, 3]$28,[4, 4, 4]$696,[4, 8, 3]$12,[4, 8, 4]$54,[6, 2, 2]$54,[6, 8, 6]$12,[6, 8, 8]$12,[7, 8, 7]$14,[7, 16, 7]$6,[8, 8, 6]$12,[8, 8, 8]$54,[14, 16, 14]$6]

Algorithm definition

The algorithm ⟨14 × 32 × 32:8060⟩ is the (Kronecker) tensor product of ⟨2 × 4 × 4:26⟩ with ⟨7 × 8 × 8:310⟩.

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