Description of fast matrix multiplication algorithm: ⟨8×24×30:3444⟩

Algorithm type

20 X^{8} Y^{8} Z^{8} + 8 X^{2} Y^{18} Z^{2} + 28 X^{4} Y^{12} Z^{4} + 28 X^{4} Y^{8} Z^{4} + 24 X^{2} Y^{12} Z^{2} + 20 X^{4} Y^{6} Z^{4} + 4 X^{2} Y^{10} Z^{2} + 212 X^{4} Y^{4} Z^{4} + 24 X^{2} Y^{8} Z^{2} + 48 X Y^{9} Z + 256 X^{2} Y^{6} Z^{2} + 224 X^{2} Y^{4} Z^{2} + 144 X Y^{6} Z + 120 X^{2} Y^{3} Z^{2} + 24 X Y^{5} Z + 652 X^{2} Y^{2} Z^{2} + 144 X Y^{4} Z + 528 X Y^{3} Z + 336 X Y^{2} Z + 600 X Y Z

Algorithm definition

The algorithm ⟨8×24×30:3444⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨4×12×15:492⟩.

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