Description of fast matrix multiplication algorithm: ⟨10×20×25:3040⟩

Algorithm type

10 X^{4} Y^{4} Z^{6} + 16 X Y^{12} Z + 40 X^{8} Y^{2} Z^{2} + 230 X^{4} Y^{4} Z^{4} + 40 X^{2} Y^{8} Z^{2} + 4 X^{2} Y^{6} Z^{3} + 92 X^{2} Y^{6} Z^{2} + 80 X^{2} Y^{4} Z^{4} + 130 X^{2} Y^{2} Z^{6} + 40 X Y^{8} Z + 10 X^{2} Y^{4} Z^{3} + 32 X Y^{6} Z^{2} + 16 X^{4} Y^{3} Z + 270 X^{2} Y^{4} Z^{2} + 40 X^{2} Y^{2} Z^{4} + 16 X Y^{6} Z + 40 X^{4} Y^{2} Z + 16 X^{2} Y^{2} Z^{3} + 80 X Y^{4} Z^{2} + 52 X Y^{3} Z^{3} + 64 X^{4} Y Z + 518 X^{2} Y^{2} Z^{2} + 104 X Y^{4} Z + 16 X Y^{3} Z^{2} + 130 X Y^{2} Z^{3} + 60 X Y^{3} Z + 168 X Y^{2} Z^{2} + 208 X Y Z^{3} + 214 X Y^{2} Z + 64 X Y Z^{2} + 240 X Y Z

Algorithm definition

The algorithm ⟨10×20×25:3040⟩ is the (Kronecker) tensor product of ⟨2×5×5:40⟩ 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