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

Algorithm type

10 X^{4} Y^{6} Z^{4} + 4 X^{2} Y^{9} Z^{2} + 470 X^{4} Y^{4} Z^{4} + 12 X Y^{9} Z + 228 X^{2} Y^{6} Z^{2} + 10 X^{2} Y^{4} Z^{4} + 10 X^{2} Y^{2} Z^{6} + 4 X Y^{6} Z^{2} + 200 X^{4} Y^{2} Z^{2} + 560 X^{2} Y^{4} Z^{2} + 190 X^{2} Y^{2} Z^{4} + 66 X Y^{6} Z + 16 X^{2} Y^{3} Z^{2} + 10 X Y^{4} Z^{2} + 4 X Y^{3} Z^{3} + 80 X^{2} Y^{3} Z + 1012 X^{2} Y^{2} Z^{2} + 90 X Y^{4} Z + 76 X Y^{3} Z^{2} + 10 X Y^{2} Z^{3} + 200 X^{2} Y^{2} Z + 152 X Y^{3} Z + 206 X Y^{2} Z^{2} + 16 X Y Z^{3} + 320 X^{2} Y Z + 404 X Y^{2} Z + 304 X Y Z^{2} + 416 X Y Z

Algorithm definition

The algorithm ⟨14×25×25:5080⟩ is the (Kronecker) tensor product of ⟨2×5×5:40⟩ 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