Description of fast matrix multiplication algorithm: ⟨14×20×25:4064⟩

Algorithm type

8 X^{4} Y^{12} Z^{4} + 376 X^{4} Y^{8} Z^{4} + 32 X^{2} Y^{12} Z^{2} + 8 X^{2} Y^{8} Z^{4} + 24 X Y^{12} Z + 448 X^{2} Y^{8} Z^{2} + 8 X^{2} Y^{4} Z^{6} + 8 X Y^{8} Z^{2} + 160 X^{4} Y^{4} Z^{2} + 152 X^{2} Y^{4} Z^{4} + 72 X Y^{8} Z + 208 X^{2} Y^{4} Z^{2} + 8 X Y^{4} Z^{3} + 160 X^{2} Y^{4} Z + 16 X^{2} Y^{3} Z^{2} + 152 X Y^{4} Z^{2} + 752 X^{2} Y^{2} Z^{2} + 208 X Y^{4} Z + 48 X Y^{3} Z + 16 X Y^{2} Z^{2} + 16 X Y Z^{3} + 320 X^{2} Y Z + 144 X Y^{2} Z + 304 X Y Z^{2} + 416 X Y Z

Algorithm definition

The algorithm ⟨14×20×25:4064⟩ is the (Kronecker) tensor product of ⟨2×4×5:32⟩ with ⟨7×5×5:127⟩.

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