Description of fast matrix multiplication algorithm: ⟨10×20×28:3302⟩

Algorithm type

6 X^{6} Y^{4} Z^{4} + 282 X^{4} Y^{4} Z^{4} + 2 X^{3} Y^{6} Z^{2} + 18 X^{6} Y^{2} Z^{2} + 6 X^{4} Y^{2} Z^{4} + 94 X^{2} Y^{6} Z^{2} + 6 X^{2} Y^{2} Z^{6} + 8 X^{3} Y^{4} Z^{2} + 54 X^{4} Y^{2} Z^{2} + 496 X^{2} Y^{4} Z^{2} + 114 X^{2} Y^{2} Z^{4} + 40 X Y^{6} Z + 6 X^{3} Y^{3} Z + 10 X^{3} Y^{2} Z^{2} + 2 X^{2} Y^{3} Z^{2} + 2 X Y^{3} Z^{3} + 24 X^{3} Y^{2} Z + 18 X^{2} Y^{3} Z + 634 X^{2} Y^{2} Z^{2} + 160 X Y^{4} Z + 38 X Y^{3} Z^{2} + 8 X Y^{2} Z^{3} + 30 X^{3} Y Z + 72 X^{2} Y^{2} Z + 10 X^{2} Y Z^{2} + 52 X Y^{3} Z + 152 X Y^{2} Z^{2} + 10 X Y Z^{3} + 90 X^{2} Y Z + 408 X Y^{2} Z + 190 X Y Z^{2} + 260 X Y Z

Algorithm definition

The algorithm ⟨10×20×28:3302⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ with ⟨5×5×7:127⟩.

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