Description of fast matrix multiplication algorithm: ⟨6×28×30:2970⟩

Algorithm type

36 X^{4} Y^{10} Z^{4} + 36 X^{4} Y^{8} Z^{4} + 18 X^{4} Y^{6} Z^{4} + 144 X^{2} Y^{10} Z^{2} + 180 X^{4} Y^{4} Z^{4} + 162 X^{2} Y^{8} Z^{2} + 108 X Y^{10} Z + 36 X^{2} Y^{5} Z^{4} + 18 X^{4} Y^{2} Z^{4} + 90 X^{2} Y^{6} Z^{2} + 36 X^{2} Y^{4} Z^{4} + 126 X Y^{8} Z + 18 X^{2} Y^{3} Z^{4} + 36 X^{4} Y^{2} Z^{2} + 288 X^{2} Y^{4} Z^{2} + 180 X^{2} Y^{2} Z^{4} + 72 X Y^{6} Z + 108 X Y^{5} Z^{2} + 18 X^{2} Y Z^{4} + 126 X Y^{4} Z^{2} + 270 X^{2} Y^{2} Z^{2} + 108 X Y^{4} Z + 72 X Y^{3} Z^{2} + 36 X^{2} Y^{2} Z + 36 X^{2} Y Z^{2} + 108 X Y^{2} Z^{2} + 252 X Y^{2} Z + 252 X Y Z^{2}

Algorithm definition

The algorithm ⟨6×28×30:2970⟩ is the (Kronecker) tensor product of ⟨2×7×5:55⟩ with ⟨3×4×6:54⟩.

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