Description of fast matrix multiplication algorithm: ⟨8×28×28:3648⟩

Algorithm type

32 X^{4} Y^{12} Z^{4} + 64 X^{4} Y^{10} Z^{4} + 48 X^{2} Y^{14} Z^{2} + 64 X^{4} Y^{8} Z^{4} + 16 X^{2} Y^{12} Z^{2} + 48 X^{4} Y^{6} Z^{4} + 272 X^{2} Y^{10} Z^{2} + 144 X^{4} Y^{4} Z^{4} + 96 X^{2} Y^{8} Z^{2} + 16 X^{4} Y^{2} Z^{4} + 208 X^{2} Y^{6} Z^{2} + 128 X^{2} Y^{5} Z^{2} + 96 X Y^{7} Z + 208 X^{2} Y^{4} Z^{2} + 32 X Y^{6} Z + 96 X^{2} Y^{3} Z^{2} + 544 X Y^{5} Z + 480 X^{2} Y^{2} Z^{2} + 192 X Y^{4} Z + 32 X^{2} Y Z^{2} + 288 X Y^{3} Z + 160 X Y^{2} Z + 384 X Y Z

Algorithm definition

The algorithm ⟨8×28×28:3648⟩ is the (Kronecker) tensor product of ⟨2×7×7:76⟩ with ⟨4×4×4:48⟩.

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