Description of fast matrix multiplication algorithm: ⟨10×20×24:2860⟩

Algorithm type

240 X^{4} Y^{4} Z^{4} + 6 X Y^{9} Z + 12 X^{6} Y^{2} Z^{2} + 6 X^{4} Y^{2} Z^{4} + 98 X^{2} Y^{6} Z^{2} + 6 X^{2} Y^{4} Z^{4} + 18 X^{2} Y^{2} Z^{6} + 2 X Y^{6} Z^{2} + 72 X^{4} Y^{2} Z^{2} + 404 X^{2} Y^{4} Z^{2} + 78 X^{2} Y^{2} Z^{4} + 52 X Y^{6} Z + 4 X^{3} Y^{3} Z + 2 X^{2} Y^{3} Z^{2} + 8 X Y^{4} Z^{2} + 6 X Y^{3} Z^{3} + 16 X^{3} Y^{2} Z + 24 X^{2} Y^{3} Z + 534 X^{2} Y^{2} Z^{2} + 112 X Y^{4} Z + 26 X Y^{3} Z^{2} + 24 X Y^{2} Z^{3} + 20 X^{3} Y Z + 96 X^{2} Y^{2} Z + 10 X^{2} Y Z^{2} + 72 X Y^{3} Z + 114 X Y^{2} Z^{2} + 30 X Y Z^{3} + 120 X^{2} Y Z + 308 X Y^{2} Z + 130 X Y Z^{2} + 210 X Y Z

Algorithm definition

The algorithm ⟨10×20×24:2860⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ with ⟨5×5×6:110⟩.

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