Description of fast matrix multiplication algorithm: ⟨14×20×24:3900⟩

Algorithm type

6 X^{4} Y^{6} Z^{4} + 2 X^{2} Y^{9} Z^{2} + 354 X^{4} Y^{4} Z^{4} + 4 X Y^{9} Z + 6 X^{4} Y^{4} Z^{2} + 138 X^{2} Y^{6} Z^{2} + 12 X^{2} Y^{4} Z^{4} + 2 X^{2} Y^{6} Z + 4 X Y^{6} Z^{2} + 120 X^{4} Y^{2} Z^{2} + 568 X^{2} Y^{4} Z^{2} + 162 X^{2} Y^{2} Z^{4} + 48 X Y^{6} Z + 8 X^{2} Y^{4} Z + 10 X^{2} Y^{3} Z^{2} + 16 X Y^{4} Z^{2} + 40 X^{2} Y^{3} Z + 722 X^{2} Y^{2} Z^{2} + 128 X Y^{4} Z + 54 X Y^{3} Z^{2} + 170 X^{2} Y^{2} Z + 64 X Y^{3} Z + 236 X Y^{2} Z^{2} + 200 X^{2} Y Z + 336 X Y^{2} Z + 270 X Y Z^{2} + 220 X Y Z

Algorithm definition

The algorithm ⟨14×20×24:3900⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ with ⟨7×5×6: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