Description of fast matrix multiplication algorithm: ⟨10×32×32:5980⟩

Algorithm type

18 X^{8} Y^{8} Z^{8} + 2 X^{2} Y^{18} Z^{2} + 2 X Y^{18} Z^{2} + 6 X^{8} Y^{8} Z^{4} + 42 X^{6} Y^{8} Z^{6} + 12 X^{4} Y^{12} Z^{4} + 6 X^{4} Y^{8} Z^{8} + 12 X^{10} Y^{4} Z^{4} + 2 X^{4} Y^{12} Z^{2} + 12 X^{4} Y^{4} Z^{10} + 14 X^{3} Y^{12} Z^{3} + 8 X^{2} Y^{12} Z^{4} + 6 X^{10} Y^{4} Z^{2} + 6 X^{6} Y^{8} Z^{2} + 78 X^{4} Y^{8} Z^{4} + 2 X^{3} Y^{12} Z + 26 X^{2} Y^{12} Z^{2} + 6 X^{2} Y^{8} Z^{6} + 6 X^{2} Y^{4} Z^{10} + 2 X Y^{12} Z^{3} + 2 X^{2} Y^{12} Z + 8 X Y^{12} Z^{2} + 14 X^{4} Y^{8} Z^{2} + 6 X^{4} Y^{4} Z^{6} + 56 X^{3} Y^{8} Z^{3} + 8 X^{2} Y^{8} Z^{4} + 2 X Y^{12} Z + 4 X^{5} Y^{6} Z^{2} + 4 X^{2} Y^{6} Z^{5} + 6 X^{6} Y^{4} Z^{2} + 2 X^{5} Y^{6} Z + 330 X^{4} Y^{4} Z^{4} + 8 X^{3} Y^{8} Z + 78 X^{2} Y^{8} Z^{2} + 8 X Y^{8} Z^{3} + 2 X Y^{6} Z^{5} + 16 X^{5} Y^{4} Z^{2} + 8 X^{2} Y^{8} Z + 2 X^{2} Y^{6} Z^{3} + 16 X^{2} Y^{4} Z^{5} + 24 X Y^{9} Z + 54 X^{6} Y^{2} Z^{2} + 8 X^{5} Y^{4} Z + 52 X^{4} Y^{4} Z^{2} + 2 X^{3} Y^{6} Z + 70 X^{3} Y^{4} Z^{3} + 182 X^{2} Y^{6} Z^{2} + 46 X^{2} Y^{4} Z^{4} + 54 X^{2} Y^{2} Z^{6} + 8 X Y^{8} Z + 8 X Y^{4} Z^{5} + 20 X^{5} Y^{2} Z^{2} + 14 X^{2} Y^{6} Z + 8 X^{2} Y^{4} Z^{3} + 20 X^{2} Y^{2} Z^{5} + 22 X Y^{6} Z^{2} + 10 X^{5} Y^{2} Z + 18 X^{4} Y^{2} Z^{2} + 18 X^{3} Y^{4} Z + 832 X^{2} Y^{4} Z^{2} + 18 X^{2} Y^{2} Z^{4} + 210 X Y^{6} Z + 10 X Y^{4} Z^{3} + 10 X Y^{2} Z^{5} + 18 X^{3} Y^{3} Z + 66 X^{2} Y^{4} Z + 10 X^{2} Y^{2} Z^{3} + 48 X Y^{4} Z^{2} + 18 X Y^{3} Z^{3} + 82 X^{3} Y^{2} Z + 6 X^{2} Y^{3} Z + 734 X^{2} Y^{2} Z^{2} + 466 X Y^{4} Z + 6 X Y^{3} Z^{2} + 72 X Y^{2} Z^{3} + 90 X^{3} Y Z + 94 X^{2} Y^{2} Z + 198 X Y^{3} Z + 84 X Y^{2} Z^{2} + 90 X Y Z^{3} + 30 X^{2} Y Z + 882 X Y^{2} Z + 30 X Y Z^{2} + 390 X Y Z

Algorithm definition

The algorithm ⟨10×32×32:5980⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ with ⟨5×8×8:230⟩.

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