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

Algorithm type

3 X^{4} Y^{10} Z^{4} + 6 X^{4} Y^{8} Z^{4} + 2 X^{4} Y^{6} Z^{4} + 13 X^{2} Y^{10} Z^{2} + 21 X^{4} Y^{4} Z^{4} + 13 X^{2} Y^{8} Z^{2} + X^{4} Y^{2} Z^{4} + 12 X^{2} Y^{6} Z^{2} + 18 X^{2} Y^{5} Z^{2} + 50 X^{2} Y^{4} Z^{2} + 2 X^{2} Y^{2} Z^{4} + 12 X^{2} Y^{3} Z^{2} + 78 X Y^{5} Z + 157 X^{2} Y^{2} Z^{2} + 78 X Y^{4} Z + 6 X^{2} Y Z^{2} + 72 X Y^{3} Z + 84 X Y^{2} Z + 12 X Y Z^{2} + 186 X Y Z

Algorithm definition

The algorithm ⟨4×10×30:826⟩ is the (Kronecker) tensor product of ⟨2×5×15:118⟩ 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