Description of fast matrix multiplication algorithm: ⟨14×20×32:5152⟩

Algorithm type

40 X^{8} Y^{16} Z^{8} + 40 X^{4} Y^{16} Z^{4} + 96 X^{4} Y^{8} Z^{8} + 288 X^{4} Y^{8} Z^{4} + 96 X^{2} Y^{8} Z^{4} + 96 X^{2} Y^{4} Z^{8} + 80 X^{4} Y^{4} Z^{4} + 288 X^{2} Y^{8} Z^{2} + 96 X^{2} Y^{4} Z^{6} + 96 X^{2} Y^{4} Z^{4} + 96 X Y^{4} Z^{4} + 576 X^{2} Y^{4} Z^{2} + 192 X^{2} Y^{2} Z^{4} + 96 X Y^{4} Z^{3} + 96 X Y^{4} Z^{2} + 576 X^{2} Y^{2} Z^{2} + 576 X Y^{4} Z + 192 X Y Z^{4} + 192 X Y Z^{3} + 192 X Y Z^{2} + 1152 X Y Z

Algorithm definition

The algorithm ⟨14×20×32:5152⟩ is the (Kronecker) tensor product of ⟨2×5×4:32⟩ with ⟨7×4×8:161⟩.

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