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

Algorithm type

5 X^{4} Y^{6} Z^{4} + 2 X^{2} Y^{9} Z^{2} + 295 X^{4} Y^{4} Z^{4} + 4 X Y^{9} Z + 10 X^{4} Y^{4} Z^{2} + 134 X^{2} Y^{6} Z^{2} + 5 X^{2} Y^{4} Z^{4} + 4 X^{2} Y^{6} Z + 2 X Y^{6} Z^{2} + 135 X^{4} Y^{2} Z^{2} + 434 X^{2} Y^{4} Z^{2} + 100 X^{2} Y^{2} Z^{4} + 44 X Y^{6} Z + 12 X^{2} Y^{4} Z + 12 X^{2} Y^{3} Z^{2} + 6 X Y^{4} Z^{2} + 54 X^{2} Y^{3} Z + 818 X^{2} Y^{2} Z^{2} + 96 X Y^{4} Z + 40 X Y^{3} Z^{2} + 186 X^{2} Y^{2} Z + 68 X Y^{3} Z + 132 X Y^{2} Z^{2} + 324 X^{2} Y Z + 324 X Y^{2} Z + 240 X Y Z^{2} + 264 X Y Z

Algorithm definition

The algorithm ⟨14×18×25:3750⟩ is the (Kronecker) tensor product of ⟨2×3×5:25⟩ with ⟨7×6×5:150⟩.

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