Description of fast matrix multiplication algorithm: ⟨6×10×12:476⟩

Algorithm type

2 X^{4} Y^{6} Z^{4} + 2 X^{6} Y^{2} Z^{4} + 18 X^{4} Y^{4} Z^{4} + 2 X^{4} Y^{2} Z^{6} + 2 X^{2} Y^{8} Z^{2} + 3 X^{2} Y^{4} Z^{6} + 6 X^{6} Y^{2} Z^{2} + 4 X^{4} Y^{4} Z^{2} + 5 X^{2} Y^{6} Z^{2} + 4 X^{2} Y^{2} Z^{6} + 8 X^{4} Y^{2} Z^{2} + 8 X^{2} Y^{4} Z^{2} + 12 X^{2} Y^{3} Z^{2} + 12 X^{3} Y Z^{2} + 112 X^{2} Y^{2} Z^{2} + 12 X^{2} Y Z^{3} + 12 X Y^{4} Z + 18 X Y^{2} Z^{3} + 36 X^{3} Y Z + 24 X^{2} Y^{2} Z + 30 X Y^{3} Z + 24 X Y Z^{3} + 48 X^{2} Y Z + 48 X Y^{2} Z + 24 X Y Z

Algorithm definition

The algorithm ⟨6×10×12:476⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨3×5×6:68⟩.

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