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

Algorithm type

10 X^{4} Y^{4} Z^{8} + 50 X^{4} Y^{4} Z^{6} + 10 X^{2} Y^{2} Z^{10} + 60 X^{4} Y^{4} Z^{4} + 4 X^{2} Y^{6} Z^{4} + 60 X^{2} Y^{2} Z^{8} + 20 X^{2} Y^{6} Z^{3} + 24 X^{2} Y^{6} Z^{2} + 10 X^{2} Y^{4} Z^{4} + 80 X^{2} Y^{2} Z^{6} + 50 X^{2} Y^{4} Z^{3} + 4 X Y^{3} Z^{5} + 60 X^{2} Y^{4} Z^{2} + 96 X^{2} Y^{2} Z^{4} + 24 X Y^{3} Z^{4} + 10 X Y^{2} Z^{5} + 80 X^{2} Y^{2} Z^{3} + 32 X Y^{3} Z^{3} + 60 X Y^{2} Z^{4} + 16 X Y Z^{5} + 226 X^{2} Y^{2} Z^{2} + 32 X Y^{3} Z^{2} + 80 X Y^{2} Z^{3} + 96 X Y Z^{4} + 52 X Y^{3} Z + 80 X Y^{2} Z^{2} + 128 X Y Z^{3} + 130 X Y^{2} Z + 128 X Y Z^{2} + 208 X Y Z

Algorithm definition

The algorithm ⟨10×10×30:1920⟩ is the (Kronecker) tensor product of ⟨2×5×5:40⟩ with ⟨5×2×6:48⟩.

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