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

Algorithm type

16 X^{8} Y^{16} Z^{8} + 6 X^{8} Y^{8} Z^{8} + 32 X^{4} Y^{16} Z^{4} + 2 X^{4} Y^{12} Z^{4} + 16 X^{2} Y^{16} Z^{2} + 144 X^{4} Y^{8} Z^{4} + 8 X^{2} Y^{12} Z^{2} + 94 X^{4} Y^{4} Z^{4} + 240 X^{2} Y^{8} Z^{2} + 8 X^{4} Y^{2} Z^{4} + 20 X^{2} Y^{6} Z^{2} + 96 X Y^{8} Z + 384 X^{2} Y^{4} Z^{2} + 48 X Y^{6} Z + 428 X^{2} Y^{2} Z^{2} + 288 X Y^{4} Z + 48 X^{2} Y Z^{2} + 48 X Y^{3} Z + 576 X Y^{2} Z + 480 X Y Z

Algorithm definition

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

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