Description of fast matrix multiplication algorithm: ⟨8×12×21:1260⟩

Algorithm type

24 X^{4} Y^{4} Z^{6} + 60 X^{4} Y^{4} Z^{4} + 8 X^{2} Y^{2} Z^{8} + 24 X^{2} Y^{6} Z^{3} + 24 X^{4} Y^{4} Z^{2} + 60 X^{2} Y^{6} Z^{2} + 48 X^{2} Y^{2} Z^{6} + 24 X^{2} Y^{6} Z + 48 X^{2} Y^{2} Z^{4} + 8 X Y^{3} Z^{4} + 72 X^{2} Y^{2} Z^{3} + 48 X Y^{3} Z^{3} + 220 X^{2} Y^{2} Z^{2} + 48 X Y^{3} Z^{2} + 24 X Y Z^{4} + 72 X^{2} Y^{2} Z + 40 X Y^{3} Z + 144 X Y Z^{3} + 144 X Y Z^{2} + 120 X Y Z

Algorithm definition

The algorithm ⟨8×12×21:1260⟩ is the (Kronecker) tensor product of ⟨2×4×3:20⟩ 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