Description of fast matrix multiplication algorithm: ⟨16×16×20:2928⟩

Algorithm type

96 X^{6} Y^{4} Z^{4} + 16 X^{4} Y^{4} Z^{6} + 16 X^{2} Y^{4} Z^{8} + 32 X^{6} Y^{4} Z^{2} + 144 X^{4} Y^{4} Z^{4} + 32 X^{4} Y^{2} Z^{6} + 16 X^{2} Y^{4} Z^{6} + 128 X^{6} Y^{2} Z^{2} + 64 X^{4} Y^{2} Z^{4} + 32 X^{2} Y^{6} Z^{2} + 64 X^{2} Y^{4} Z^{4} + 160 X^{4} Y^{2} Z^{2} + 32 X^{2} Y^{4} Z^{2} + 192 X^{3} Y^{2} Z^{2} + 32 X^{2} Y^{2} Z^{3} + 32 X Y^{2} Z^{4} + 64 X^{3} Y^{2} Z + 432 X^{2} Y^{2} Z^{2} + 64 X^{2} Y Z^{3} + 32 X Y^{2} Z^{3} + 256 X^{3} Y Z + 128 X^{2} Y Z^{2} + 64 X Y^{3} Z + 128 X Y^{2} Z^{2} + 320 X^{2} Y Z + 64 X Y^{2} Z + 288 X Y Z

Algorithm definition

The algorithm ⟨16×16×20:2928⟩ is the (Kronecker) tensor product of ⟨4×4×4:48⟩ with ⟨4×4×5:61⟩.

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