Description of fast matrix multiplication algorithm: ⟨15×16×20:2888⟩

Algorithm type

12 X^{12} Y Z + 10 X^{4} Y^{4} Z^{6} + 8 X Y^{12} Z + 3 X^{2} Y^{2} Z^{9} + 40 X^{8} Y^{2} Z^{2} + 230 X^{4} Y^{4} Z^{4} + 40 X^{2} Y^{8} Z^{2} + 2 X^{2} Y^{4} Z^{6} + 8 X^{8} Y^{2} Z + 3 X^{6} Y^{2} Z^{3} + 2 X^{4} Y^{4} Z^{3} + 8 X^{2} Y^{8} Z + 2 X^{2} Y^{6} Z^{3} + 8 X Y^{8} Z^{2} + 39 X Y Z^{9} + 4 X^{8} Y Z + 69 X^{6} Y^{2} Z^{2} + 46 X^{4} Y^{4} Z^{2} + 46 X^{2} Y^{6} Z^{2} + 126 X^{2} Y^{4} Z^{4} + 200 X^{2} Y^{2} Z^{6} + 44 X Y^{8} Z + X^{4} Y^{2} Z^{3} + 11 X^{2} Y^{4} Z^{3} + 16 X Y^{6} Z^{2} + 16 X Y^{4} Z^{4} + 50 X Y^{2} Z^{6} + 8 X^{4} Y^{3} Z + 31 X^{4} Y^{2} Z^{2} + 12 X^{4} Y Z^{3} + 12 X^{3} Y^{4} Z + 309 X^{2} Y^{4} Z^{2} + 63 X^{2} Y^{2} Z^{4} + 8 X Y^{6} Z + 12 X Y^{4} Z^{3} + 25 X Y Z^{6} + 44 X^{4} Y^{2} Z + 4 X^{4} Y Z^{2} + 24 X^{3} Y^{2} Z^{2} + 39 X^{3} Y Z^{3} + 12 X^{2} Y^{4} Z + 29 X^{2} Y^{2} Z^{3} + 100 X Y^{4} Z^{2} + 26 X Y^{3} Z^{3} + 16 X Y^{2} Z^{4} + 12 X^{4} Y Z + 12 X^{3} Y^{2} Z + 12 X^{3} Y Z^{2} + 235 X^{2} Y^{2} Z^{2} + 13 X^{2} Y Z^{3} + 56 X Y^{4} Z + 8 X Y^{3} Z^{2} + 155 X Y^{2} Z^{3} + 4 X Y Z^{4} + 45 X^{3} Y Z + 34 X^{2} Y^{2} Z + 4 X^{2} Y Z^{2} + 30 X Y^{3} Z + 102 X Y^{2} Z^{2} + 84 X Y Z^{3} + 15 X^{2} Y Z + 177 X Y^{2} Z + 27 X Y Z^{2} + 45 X Y Z

Algorithm definition

The algorithm ⟨15×16×20:2888⟩ is the (Kronecker) tensor product of ⟨3×4×4:38⟩ with ⟨5×4×5:76⟩.

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