Description of fast matrix multiplication algorithm: ⟨3×15×32:1068⟩

Algorithm type

2 X^{3} Y^{6} Z^{2} + 4 X^{3} Y^{5} Z^{2} + 12 X^{2} Y^{6} Z^{2} + 4 X^{2} Y^{5} Z^{2} + 2 X Y^{6} Z^{2} + 6 X^{3} Y^{3} Z^{2} + 4 X^{3} Y^{2} Z^{3} + 60 X^{2} Y^{4} Z^{2} + 2 X^{2} Y^{3} Z^{3} + 10 X Y^{6} Z + 6 X Y^{5} Z^{2} + 2 X Y^{4} Z^{3} + 2 X^{3} Y Z^{3} + 22 X^{2} Y^{3} Z^{2} + 4 X^{2} Y^{2} Z^{3} + 14 X Y^{4} Z^{2} + 6 X Y^{3} Z^{3} + 4 X^{3} Y Z^{2} + 260 X^{2} Y^{2} Z^{2} + 10 X^{2} Y Z^{3} + 38 X Y^{4} Z + 14 X Y^{3} Z^{2} + 30 X Y^{2} Z^{3} + 4 X^{3} Y Z + 50 X Y^{3} Z + 106 X Y^{2} Z^{2} + 66 X Y Z^{3} + 10 X^{2} Y Z + 142 X Y^{2} Z + 116 X Y Z^{2} + 56 X Y Z

Algorithm definition

The algorithm ⟨3×15×32:1068⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨3×15×16:534⟩.

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