Description of fast matrix multiplication algorithm: ⟨10×16×25:2508⟩

Algorithm type

7 X^{4} Y^{4} Z^{6} + 20 X Y^{12} Z + 28 X^{8} Y^{2} Z^{2} + 161 X^{4} Y^{4} Z^{4} + 28 X^{2} Y^{8} Z^{2} + 5 X^{2} Y^{6} Z^{3} + 115 X^{2} Y^{6} Z^{2} + 56 X^{2} Y^{4} Z^{4} + 91 X^{2} Y^{2} Z^{6} + 16 X Y^{8} Z + 4 X^{2} Y^{4} Z^{3} + 40 X Y^{6} Z^{2} + 20 X^{4} Y^{3} Z + 120 X^{2} Y^{4} Z^{2} + 28 X^{2} Y^{2} Z^{4} + 20 X Y^{6} Z + 16 X^{4} Y^{2} Z + 17 X^{2} Y^{2} Z^{3} + 32 X Y^{4} Z^{2} + 65 X Y^{3} Z^{3} + 68 X^{4} Y Z + 496 X^{2} Y^{2} Z^{2} + 84 X Y^{4} Z + 20 X Y^{3} Z^{2} + 52 X Y^{2} Z^{3} + 75 X Y^{3} Z + 152 X Y^{2} Z^{2} + 221 X Y Z^{3} + 128 X Y^{2} Z + 68 X Y Z^{2} + 255 X Y Z

Algorithm definition

The algorithm ⟨10×16×25:2508⟩ is the (Kronecker) tensor product of ⟨2×4×5:33⟩ 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