Description of fast matrix multiplication algorithm: ⟨8×24×32:3591⟩

Algorithm type

6 X^{8} Y^{16} Z^{8} + 19 X^{8} Y^{8} Z^{8} + 17 X^{4} Y^{16} Z^{4} + 8 X^{2} Y^{18} Z^{2} + 27 X^{4} Y^{12} Z^{4} + 10 X^{2} Y^{16} Z^{2} + 10 X^{2} Y^{14} Z^{2} + 92 X^{4} Y^{8} Z^{4} + 12 X^{2} Y^{10} Z^{2} + 194 X^{4} Y^{4} Z^{4} + 152 X^{2} Y^{8} Z^{2} + 48 X Y^{9} Z + 248 X^{2} Y^{6} Z^{2} + 60 X Y^{8} Z + 60 X Y^{7} Z + 336 X^{2} Y^{4} Z^{2} + 72 X Y^{5} Z + 612 X^{2} Y^{2} Z^{2} + 300 X Y^{4} Z + 516 X Y^{3} Z + 792 X Y Z

Algorithm definition

The algorithm ⟨8×24×32:3591⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨4×12×16:513⟩.

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