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

Algorithm type

4 X^{4} Y^{10} Z^{8} + 4 X^{4} Y^{8} Z^{8} + 22 X^{4} Y^{10} Z^{4} + 2 X^{4} Y^{6} Z^{8} + 22 X^{4} Y^{8} Z^{4} + 20 X^{4} Y^{4} Z^{8} + 12 X^{2} Y^{10} Z^{4} + 8 X^{2} Y^{5} Z^{8} + 11 X^{4} Y^{6} Z^{4} + 2 X^{4} Y^{2} Z^{8} + 66 X^{2} Y^{10} Z^{2} + 14 X^{2} Y^{8} Z^{4} + 8 X^{2} Y^{4} Z^{8} + 16 X^{2} Y^{5} Z^{6} + 4 X^{2} Y^{3} Z^{8} + 110 X^{4} Y^{4} Z^{4} + 77 X^{2} Y^{8} Z^{2} + 8 X^{2} Y^{6} Z^{4} + 16 X^{2} Y^{4} Z^{6} + 40 X^{2} Y^{2} Z^{8} + 8 X^{2} Y^{5} Z^{4} + 8 X^{2} Y^{3} Z^{6} + 4 X^{2} Y Z^{8} + 15 X^{4} Y^{2} Z^{4} + 44 X^{2} Y^{6} Z^{2} + 20 X^{2} Y^{4} Z^{4} + 80 X^{2} Y^{2} Z^{6} + 24 X Y^{5} Z^{4} + 36 X^{2} Y^{5} Z^{2} + 4 X^{2} Y^{3} Z^{4} + 8 X^{2} Y Z^{6} + 48 X Y^{5} Z^{3} + 28 X Y^{4} Z^{4} + 22 X^{4} Y^{2} Z^{2} + 102 X^{2} Y^{4} Z^{2} + 68 X^{2} Y^{2} Z^{4} + 24 X Y^{5} Z^{2} + 56 X Y^{4} Z^{3} + 16 X Y^{3} Z^{4} + 18 X^{2} Y^{3} Z^{2} + 12 X^{2} Y Z^{4} + 108 X Y^{5} Z + 28 X Y^{4} Z^{2} + 32 X Y^{3} Z^{3} + 24 X Y^{2} Z^{4} + 334 X^{2} Y^{2} Z^{2} + 16 X^{2} Y Z^{3} + 126 X Y^{4} Z + 16 X Y^{3} Z^{2} + 48 X Y^{2} Z^{3} + 56 X Y Z^{4} + 26 X^{2} Y Z^{2} + 72 X Y^{3} Z + 24 X Y^{2} Z^{2} + 112 X Y Z^{3} + 36 X^{2} Y Z + 108 X Y^{2} Z + 56 X Y Z^{2} + 252 X Y Z

Algorithm definition

The algorithm ⟨10×14×30:2585⟩ is the (Kronecker) tensor product of ⟨2×7×5:55⟩ with ⟨5×2×6:47⟩.

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