Description of fast matrix multiplication algorithm: ⟨8×10×24:1218⟩

Algorithm type

X^{4} Y^{6} Z^{4} + 65 X^{4} Y^{4} Z^{4} + X^{2} Y^{6} Z^{4} + 6 X^{2} Y^{6} Z^{2} + 7 X^{2} Y^{4} Z^{4} + 2 X^{2} Y^{2} Z^{6} + 3 X^{4} Y^{2} Z^{2} + 34 X^{2} Y^{4} Z^{2} + 32 X^{2} Y^{2} Z^{4} + 6 X^{2} Y^{3} Z^{2} + 413 X^{2} Y^{2} Z^{2} + 6 X Y^{3} Z^{2} + 36 X Y^{3} Z + 42 X Y^{2} Z^{2} + 12 X Y Z^{3} + 18 X^{2} Y Z + 204 X Y^{2} Z + 192 X Y Z^{2} + 138 X Y Z

Algorithm definition

The algorithm ⟨8×10×24:1218⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨4×5×12:174⟩.

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