Description of fast matrix multiplication algorithm: ⟨5×15×28:1421⟩

Algorithm type

160 X^{4} Y^{6} Z^{5} + 32 X^{2} Y^{9} Z^{3} + 240 X^{2} Y^{6} Z^{5} + 48 X Y^{9} Z^{3} + 64 X^{2} Y^{6} Z^{3} + 10 X^{2} Y^{6} Z^{2} + 96 X Y^{6} Z^{3} + 2 X^{2} Y^{5} Z^{2} + 34 X^{2} Y^{4} Z^{2} + 128 X^{2} Y^{3} Z^{3} + 22 X Y^{6} Z + 2 X^{2} Y^{3} Z^{2} + 4 X Y^{5} Z + 192 X Y^{3} Z^{3} + 2 X^{2} Y^{3} Z + 44 X^{2} Y^{2} Z^{2} + 52 X Y^{4} Z + 2 X Y^{2} Z^{3} + 36 X Y^{3} Z + 6 X Y^{2} Z^{2} + 143 X Y^{2} Z + 100 X Y Z

Algorithm definition

The algorithm ⟨5×15×28:1421⟩ is the projection [[0, 0], [29]] of ⟨5×15×29:1421⟩.

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