Description of fast matrix multiplication algorithm: ⟨8×24×26:2954⟩

Algorithm type

6 X^{8} Y^{10} Z^{8} + 12 X^{8} Y^{8} Z^{8} + 16 X^{4} Y^{14} Z^{4} + 27 X^{4} Y^{12} Z^{4} + X^{2} Y^{16} Z^{2} + 16 X^{4} Y^{10} Z^{4} + 17 X^{2} Y^{14} Z^{2} + 23 X^{4} Y^{8} Z^{4} + 19 X^{2} Y^{12} Z^{2} + 28 X^{4} Y^{6} Z^{4} + 24 X^{2} Y^{10} Z^{2} + 36 X^{4} Y^{5} Z^{4} + 110 X^{4} Y^{4} Z^{4} + 22 X^{2} Y^{8} Z^{2} + 96 X^{2} Y^{7} Z^{2} + 237 X^{2} Y^{6} Z^{2} + 6 X Y^{8} Z + 96 X^{2} Y^{5} Z^{2} + 102 X Y^{7} Z + 174 X^{2} Y^{4} Z^{2} + 114 X Y^{6} Z + 168 X^{2} Y^{3} Z^{2} + 144 X Y^{5} Z + 290 X^{2} Y^{2} Z^{2} + 132 X Y^{4} Z + 450 X Y^{3} Z + 216 X Y^{2} Z + 372 X Y Z

Algorithm definition

The algorithm ⟨8×24×26:2954⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨4×12×13:422⟩.

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