Description of fast matrix multiplication algorithm: ⟨8×20×30:2920⟩

Algorithm type

20 X^{6} Y^{6} Z^{8} + 8 X^{3} Y^{9} Z^{4} + 10 X^{4} Y^{6} Z^{4} + 20 X^{3} Y^{6} Z^{4} + 4 X^{2} Y^{9} Z^{2} + 180 X^{4} Y^{4} Z^{4} + 10 X^{2} Y^{2} Z^{8} + 12 X Y^{9} Z + 32 X^{3} Y^{3} Z^{4} + 112 X^{2} Y^{6} Z^{2} + 210 X^{2} Y^{4} Z^{2} + 42 X Y^{6} Z + 4 X Y^{3} Z^{4} + 16 X^{2} Y^{3} Z^{2} + 10 X Y^{2} Z^{4} + 738 X^{2} Y^{2} Z^{2} + 30 X Y^{4} Z + 16 X Y Z^{4} + 228 X Y^{3} Z + 498 X Y^{2} Z + 720 X Y Z

Algorithm definition

The algorithm ⟨8×20×30:2920⟩ is the (Kronecker) tensor product of ⟨2×5×5:40⟩ with ⟨4×4×6:73⟩.

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