Description of fast matrix multiplication algorithm: ⟨10×10×30:1834⟩

Algorithm type

2 X^{8} Y^{2} Z^{2} + X^{4} Y^{6} Z^{2} + 113 X^{4} Y^{4} Z^{4} + X^{4} Y^{2} Z^{6} + X^{6} Y^{2} Z^{2} + 2 X^{4} Y^{4} Z^{2} + 2 X^{4} Y^{2} Z^{4} + 5 X^{2} Y^{6} Z^{2} + 5 X^{2} Y^{2} Z^{6} + 13 X^{4} Y^{2} Z^{2} + 37 X^{2} Y^{4} Z^{2} + 37 X^{2} Y^{2} Z^{4} + 12 X^{4} Y Z + 6 X^{2} Y^{3} Z + 721 X^{2} Y^{2} Z^{2} + 6 X^{2} Y Z^{3} + 6 X^{3} Y Z + 12 X^{2} Y^{2} Z + 12 X^{2} Y Z^{2} + 30 X Y^{3} Z + 30 X Y Z^{3} + 78 X^{2} Y Z + 222 X Y^{2} Z + 222 X Y Z^{2} + 258 X Y Z

Algorithm definition

The algorithm ⟨10×10×30:1834⟩ is the (Kronecker) tensor product of ⟨5×5×15:262⟩ with ⟨2×2×2:7⟩.

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