Description of fast matrix multiplication algorithm: ⟨6×20×28:2128⟩

Algorithm type

40 X^{4} Y^{6} Z^{4} + 10 X Y^{12} Z + 8 X^{2} Y^{9} Z^{2} + 8 X^{4} Y^{6} Z^{2} + 100 X^{4} Y^{4} Z^{4} + 50 X^{2} Y^{8} Z^{2} + 8 X^{2} Y^{6} Z^{4} + 12 X^{6} Y^{3} Z^{2} + 10 X^{2} Y^{8} Z + 12 X^{2} Y^{3} Z^{6} + 22 X Y^{9} Z + 10 X Y^{8} Z^{2} + 30 X^{6} Y^{2} Z^{2} + 20 X^{4} Y^{4} Z^{2} + 174 X^{2} Y^{6} Z^{2} + 20 X^{2} Y^{4} Z^{4} + 30 X^{2} Y^{2} Z^{6} + 55 X Y^{8} Z + 4 X^{4} Y^{3} Z^{2} + 22 X^{2} Y^{6} Z + 4 X^{2} Y^{3} Z^{4} + 22 X Y^{6} Z^{2} + 10 X^{4} Y^{2} Z^{2} + 15 X^{3} Y^{4} Z + 180 X^{2} Y^{4} Z^{2} + 10 X^{2} Y^{2} Z^{4} + 135 X Y^{6} Z + 15 X Y^{4} Z^{3} + 33 X^{3} Y^{3} Z + 19 X^{2} Y^{4} Z + 12 X^{2} Y^{3} Z^{2} + 19 X Y^{4} Z^{2} + 33 X Y^{3} Z^{3} + 21 X^{3} Y^{2} Z + 11 X^{2} Y^{3} Z + 220 X^{2} Y^{2} Z^{2} + 92 X Y^{4} Z + 11 X Y^{3} Z^{2} + 21 X Y^{2} Z^{3} + 57 X^{3} Y Z + 45 X^{2} Y^{2} Z + 71 X Y^{3} Z + 45 X Y^{2} Z^{2} + 57 X Y Z^{3} + 19 X^{2} Y Z + 230 X Y^{2} Z + 19 X Y Z^{2} + 57 X Y Z

Algorithm definition

The algorithm ⟨6×20×28:2128⟩ is the (Kronecker) tensor product of ⟨2×5×7:56⟩ with ⟨3×4×4:38⟩.

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