Description of fast matrix multiplication algorithm: ⟨8×30×32:4424⟩

Algorithm type

32 X^{8} Y^{16} Z^{8} + X^{4} Y^{18} Z^{4} + 69 X^{4} Y^{16} Z^{4} + X^{4} Y^{14} Z^{4} + 6 X^{2} Y^{18} Z^{2} + 2 X^{4} Y^{12} Z^{4} + 39 X^{2} Y^{16} Z^{2} + 9 X^{4} Y^{10} Z^{4} + 10 X^{2} Y^{14} Z^{2} + 221 X^{4} Y^{8} Z^{4} + 17 X^{2} Y^{12} Z^{2} + 41 X^{4} Y^{6} Z^{4} + 30 X^{2} Y^{10} Z^{2} + 6 X^{2} Y^{9} Z^{2} + 80 X^{4} Y^{4} Z^{4} + 436 X^{2} Y^{8} Z^{2} + 6 X^{2} Y^{7} Z^{2} + 36 X Y^{9} Z + 119 X^{2} Y^{6} Z^{2} + 234 X Y^{8} Z + 54 X^{2} Y^{5} Z^{2} + 60 X Y^{7} Z + 218 X^{2} Y^{4} Z^{2} + 102 X Y^{6} Z + 246 X^{2} Y^{3} Z^{2} + 180 X Y^{5} Z + 573 X^{2} Y^{2} Z^{2} + 132 X Y^{4} Z + 642 X Y^{3} Z + 264 X Y^{2} Z + 558 X Y Z

Algorithm definition

The algorithm ⟨8×30×32:4424⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨4×15×16:632⟩.

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