Description of fast matrix multiplication algorithm: ⟨14×14×28:3297⟩

Algorithm type

8 X^{8} Y^{8} Z^{8} + 4 X^{8} Y^{8} Z^{6} + 5 X^{6} Y^{8} Z^{8} + 4 X^{6} Y^{8} Z^{6} + 3 X^{6} Y^{6} Z^{8} + 3 X^{6} Y^{6} Z^{6} + X^{8} Y^{4} Z^{4} + 8 X^{4} Y^{8} Z^{4} + 16 X^{4} Y^{6} Z^{6} + 4 X^{4} Y^{4} Z^{8} + 4 X^{6} Y^{4} Z^{4} + 3 X^{4} Y^{8} Z^{2} + 12 X^{4} Y^{6} Z^{4} + 14 X^{4} Y^{4} Z^{6} + 24 X^{2} Y^{6} Z^{6} + 2 X^{2} Y^{4} Z^{8} + 151 X^{4} Y^{4} Z^{4} + 4 X^{2} Y^{8} Z^{2} + 2 X^{2} Y^{4} Z^{6} + 5 X^{2} Y^{2} Z^{8} + 24 X^{4} Y^{4} Z^{3} + 30 X^{3} Y^{4} Z^{4} + 16 X^{4} Y^{4} Z^{2} + 17 X^{4} Y^{2} Z^{4} + 24 X^{3} Y^{4} Z^{3} + 18 X^{3} Y^{3} Z^{4} + 24 X^{2} Y^{6} Z^{2} + 2 X^{2} Y^{4} Z^{4} + 24 X^{2} Y^{2} Z^{6} + 18 X^{3} Y^{3} Z^{3} + 11 X^{4} Y^{2} Z^{2} + 84 X^{2} Y^{4} Z^{2} + 96 X^{2} Y^{3} Z^{3} + 62 X^{2} Y^{2} Z^{4} + 24 X^{3} Y^{2} Z^{2} + 18 X^{2} Y^{4} Z + 72 X^{2} Y^{3} Z^{2} + 84 X^{2} Y^{2} Z^{3} + 144 X Y^{3} Z^{3} + 12 X Y^{2} Z^{4} + 698 X^{2} Y^{2} Z^{2} + 24 X Y^{4} Z + 12 X Y^{2} Z^{3} + 30 X Y Z^{4} + 96 X^{2} Y^{2} Z + 102 X^{2} Y Z^{2} + 144 X Y^{3} Z + 12 X Y^{2} Z^{2} + 144 X Y Z^{3} + 30 X^{2} Y Z + 216 X Y^{2} Z + 228 X Y Z^{2} + 480 X Y Z

Algorithm definition

The algorithm ⟨14×14×28:3297⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨7×7×14:471⟩.

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