Description of fast matrix multiplication algorithm: ⟨6×10×16:630⟩

Algorithm type

X^{6} Y^{2} Z^{6} + 3 X^{4} Y^{6} Z^{4} + 27 X^{4} Y^{4} Z^{4} + X^{2} Y^{4} Z^{6} + X^{6} Y^{2} Z^{2} + 5 X^{2} Y^{6} Z^{2} + 7 X^{2} Y^{4} Z^{4} + 10 X^{2} Y^{2} Z^{6} + X^{4} Y^{2} Z^{2} + 16 X^{2} Y^{4} Z^{2} + 14 X^{2} Y^{2} Z^{4} + 6 X^{3} Y Z^{3} + 18 X^{2} Y^{3} Z^{2} + 166 X^{2} Y^{2} Z^{2} + 6 X Y^{2} Z^{3} + 6 X^{3} Y Z + 30 X Y^{3} Z + 42 X Y^{2} Z^{2} + 60 X Y Z^{3} + 6 X^{2} Y Z + 96 X Y^{2} Z + 84 X Y Z^{2} + 24 X Y Z

Algorithm definition

The algorithm ⟨6×10×16:630⟩ is the (Kronecker) tensor product of ⟨3×5×8:90⟩ with ⟨2×2×2:7⟩.

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