Description of fast matrix multiplication algorithm: ⟨8×12×28:1638⟩

Algorithm type

36 X^{4} Y^{4} Z^{6} + 90 X^{4} Y^{4} Z^{4} + 12 X^{2} Y^{2} Z^{8} + 12 X^{2} Y^{6} Z^{3} + 36 X^{4} Y^{4} Z^{2} + 30 X^{2} Y^{6} Z^{2} + 72 X^{2} Y^{2} Z^{6} + 12 X^{2} Y^{6} Z + 48 X^{2} Y^{4} Z^{3} + 120 X^{2} Y^{4} Z^{2} + 72 X^{2} Y^{2} Z^{4} + 4 X Y^{3} Z^{4} + 48 X^{2} Y^{4} Z + 60 X^{2} Y^{2} Z^{3} + 24 X Y^{3} Z^{3} + 16 X Y^{2} Z^{4} + 210 X^{2} Y^{2} Z^{2} + 24 X Y^{3} Z^{2} + 96 X Y^{2} Z^{3} + 20 X Y Z^{4} + 60 X^{2} Y^{2} Z + 20 X Y^{3} Z + 96 X Y^{2} Z^{2} + 120 X Y Z^{3} + 80 X Y^{2} Z + 120 X Y Z^{2} + 100 X Y Z

Algorithm definition

The algorithm ⟨8×12×28:1638⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ with ⟨4×3×7:63⟩.

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