Description of fast matrix multiplication algorithm: ⟨6×12×32:1430⟩

Algorithm type

96 X^{4} Y^{6} Z^{6} + 32 X^{2} Y^{9} Z^{3} + 144 X^{2} Y^{6} Z^{6} + 48 X Y^{9} Z^{3} + 18 X^{4} Y^{4} Z^{4} + 128 X^{2} Y^{6} Z^{3} + 6 X^{2} Y^{6} Z^{2} + 192 X Y^{6} Z^{3} + 36 X^{4} Y^{2} Z^{2} + 24 X^{2} Y^{4} Z^{2} + 160 X^{2} Y^{3} Z^{3} + 240 X Y^{3} Z^{3} + 12 X^{2} Y^{3} Z + 66 X^{2} Y^{2} Z^{2} + 48 X^{2} Y^{2} Z + 12 X Y^{3} Z + 60 X^{2} Y Z + 48 X Y^{2} Z + 60 X Y Z

Algorithm definition

The algorithm ⟨6×12×32:1430⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ with ⟨3×3×8:55⟩.

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