Description of fast matrix multiplication algorithm: ⟨8×10×28:1456⟩

Algorithm type

24 X^{4} Y^{6} Z^{4} + 60 X^{4} Y^{4} Z^{4} + 30 X^{2} Y^{8} Z^{2} + 8 X^{2} Y^{3} Z^{6} + 66 X^{2} Y^{6} Z^{2} + 20 X^{2} Y^{2} Z^{6} + 32 X^{2} Y^{3} Z^{4} + 42 X^{2} Y^{4} Z^{2} + 80 X^{2} Y^{2} Z^{4} + 10 X Y^{4} Z^{3} + 40 X^{2} Y^{3} Z^{2} + 40 X Y^{4} Z^{2} + 22 X Y^{3} Z^{3} + 214 X^{2} Y^{2} Z^{2} + 50 X Y^{4} Z + 88 X Y^{3} Z^{2} + 14 X Y^{2} Z^{3} + 110 X Y^{3} Z + 56 X Y^{2} Z^{2} + 38 X Y Z^{3} + 70 X Y^{2} Z + 152 X Y Z^{2} + 190 X Y Z

Algorithm definition

The algorithm ⟨8×10×28:1456⟩ is the (Kronecker) tensor product of ⟨2×5×7:56⟩ with ⟨4×2×4:26⟩.

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