Description of fast matrix multiplication algorithm: ⟨10×15×20:1880⟩

Algorithm type

130 X^{4} Y^{4} Z^{4} + 12 X Y^{9} Z + 40 X^{6} Y^{2} Z^{2} + 20 X^{4} Y^{2} Z^{4} + 82 X^{2} Y^{6} Z^{2} + 10 X^{2} Y^{4} Z^{4} + 20 X^{2} Y^{2} Z^{6} + 4 X Y^{6} Z^{2} + 60 X^{4} Y^{2} Z^{2} + 160 X^{2} Y^{4} Z^{2} + 80 X^{2} Y^{2} Z^{4} + 42 X Y^{6} Z + 16 X^{3} Y^{3} Z + 8 X^{2} Y^{3} Z^{2} + 10 X Y^{4} Z^{2} + 8 X Y^{3} Z^{3} + 40 X^{3} Y^{2} Z + 24 X^{2} Y^{3} Z + 278 X^{2} Y^{2} Z^{2} + 30 X Y^{4} Z + 32 X Y^{3} Z^{2} + 20 X Y^{2} Z^{3} + 64 X^{3} Y Z + 60 X^{2} Y^{2} Z + 32 X^{2} Y Z^{2} + 68 X Y^{3} Z + 96 X Y^{2} Z^{2} + 32 X Y Z^{3} + 96 X^{2} Y Z + 98 X Y^{2} Z + 128 X Y Z^{2} + 80 X Y Z

Algorithm definition

The algorithm ⟨10×15×20:1880⟩ is the (Kronecker) tensor product of ⟨2×5×5:40⟩ with ⟨5×3×4:47⟩.

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