Description of fast matrix multiplication algorithm: ⟨16×16×24:3556⟩

Algorithm type

28 X^{8} Y^{8} Z^{8} + 24 X^{4} Y^{12} Z^{4} + 8 X^{4} Y^{4} Z^{12} + 8 X^{4} Y^{8} Z^{4} + 32 X^{4} Y^{4} Z^{8} + 8 X^{2} Y^{6} Z^{6} + 272 X^{4} Y^{4} Z^{4} + 32 X^{2} Y^{6} Z^{4} + 184 X^{2} Y^{6} Z^{2} + 56 X^{2} Y^{2} Z^{6} + 96 X^{2} Y^{4} Z^{2} + 224 X^{2} Y^{2} Z^{4} + 48 X Y^{3} Z^{3} + 760 X^{2} Y^{2} Z^{2} + 192 X Y^{3} Z^{2} + 240 X Y^{3} Z + 48 X Y Z^{3} + 288 X Y^{2} Z + 192 X Y Z^{2} + 816 X Y Z

Algorithm definition

The algorithm ⟨16×16×24:3556⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨8×8×12:508⟩.

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