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

Algorithm type

8 X^{2} Y^{12} Z^{4} + 8 X^{6} Y^{8} Z^{2} + 256 X^{4} Y^{8} Z^{4} + 8 X Y^{12} Z^{2} + 8 X^{4} Y^{8} Z^{2} + 8 X^{4} Y^{4} Z^{6} + 8 X^{2} Y^{8} Z^{4} + 8 X^{4} Y^{4} Z^{4} + 8 X^{3} Y^{8} Z + 344 X^{2} Y^{8} Z^{2} + 8 X^{2} Y^{8} Z + 8 X Y^{8} Z^{2} + 88 X^{4} Y^{4} Z^{2} + 88 X^{2} Y^{4} Z^{4} + 88 X Y^{8} Z + 8 X^{2} Y^{4} Z^{3} + 184 X^{2} Y^{4} Z^{2} + 88 X^{2} Y^{4} Z + 88 X Y^{4} Z^{2} + 16 X^{3} Y^{2} Z + 512 X^{2} Y^{2} Z^{2} + 16 X^{2} Y Z^{3} + 176 X Y^{4} Z + 16 X Y^{3} Z^{2} + 16 X^{2} Y^{2} Z + 16 X^{2} Y Z^{2} + 16 X Y^{2} Z^{2} + 176 X^{2} Y Z + 176 X Y^{2} Z + 176 X Y Z^{2} + 352 X Y Z

Algorithm definition

The algorithm ⟨10×20×25:2976⟩ is the (Kronecker) tensor product of ⟨2×4×5:32⟩ with ⟨5×5×5:93⟩.

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