Description of fast matrix multiplication algorithm: ⟨8×20×25:2480⟩

Algorithm type

10 X^{8} Y^{8} Z^{8} + 4 X^{4} Y^{12} Z^{4} + 10 X^{4} Y^{8} Z^{4} + 10 X^{4} Y^{6} Z^{4} + 4 X^{2} Y^{9} Z^{2} + 156 X^{4} Y^{4} Z^{4} + 8 X Y^{9} Z + 10 X^{4} Y^{4} Z^{2} + 20 X^{4} Y^{2} Z^{4} + 86 X^{2} Y^{6} Z^{2} + 10 X^{2} Y^{2} Z^{6} + 4 X^{2} Y^{6} Z + 30 X^{4} Y^{2} Z^{2} + 220 X^{2} Y^{4} Z^{2} + 20 X^{2} Y^{2} Z^{4} + 52 X Y^{6} Z + 10 X^{2} Y^{4} Z + 24 X^{2} Y^{3} Z^{2} + 4 X Y^{3} Z^{3} + 12 X^{2} Y^{3} Z + 514 X^{2} Y^{2} Z^{2} + 80 X Y^{4} Z + 8 X Y^{3} Z^{2} + 10 X Y^{2} Z^{3} + 46 X^{2} Y^{2} Z + 32 X^{2} Y Z^{2} + 140 X Y^{3} Z + 20 X Y^{2} Z^{2} + 16 X Y Z^{3} + 48 X^{2} Y Z + 398 X Y^{2} Z + 32 X Y Z^{2} + 432 X Y Z

Algorithm definition

The algorithm ⟨8×20×25:2480⟩ is the (Kronecker) tensor product of ⟨4×4×5:62⟩ with ⟨2×5×5:40⟩.

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