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

Algorithm type

3 X^{6} Y^{4} Z^{2} + 96 X^{4} Y^{4} Z^{4} + 3 X^{4} Y^{2} Z^{6} + 3 X^{2} Y^{6} Z^{4} + 3 X^{4} Y^{4} Z^{2} + 3 X^{4} Y^{2} Z^{4} + 3 X^{2} Y^{4} Z^{4} + 6 X Y^{6} Z^{2} + 33 X^{4} Y^{2} Z^{2} + 6 X^{3} Y^{4} Z + 225 X^{2} Y^{4} Z^{2} + 33 X^{2} Y^{2} Z^{4} + 6 X^{2} Y^{4} Z + 6 X^{2} Y^{2} Z^{3} + 6 X Y^{4} Z^{2} + 6 X^{3} Y^{2} Z + 264 X^{2} Y^{2} Z^{2} + 6 X^{2} Y Z^{3} + 66 X Y^{4} Z + 6 X Y^{3} Z^{2} + 72 X^{2} Y^{2} Z + 6 X^{2} Y Z^{2} + 72 X Y^{2} Z^{2} + 66 X^{2} Y Z + 198 X Y^{2} Z + 66 X Y Z^{2} + 132 X Y Z

Algorithm definition

The algorithm ⟨10×15×15:1395⟩ is the (Kronecker) tensor product of ⟨2×3×3:15⟩ with ⟨5×5×5:93⟩.

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