Description of fast matrix multiplication algorithm: ⟨10×21×24:3000⟩

Algorithm type

4 X^{4} Y^{4} Z^{6} + 236 X^{4} Y^{4} Z^{4} + 4 X^{2} Y^{6} Z^{3} + 4 X^{4} Y^{2} Z^{4} + 236 X^{2} Y^{6} Z^{2} + 8 X^{2} Y^{4} Z^{4} + 8 X^{2} Y^{2} Z^{6} + 8 X Y^{6} Z^{2} + 80 X^{4} Y^{2} Z^{2} + 108 X^{2} Y^{4} Z^{2} + 64 X^{2} Y^{2} Z^{4} + 108 X Y^{6} Z + 4 X^{2} Y^{3} Z^{2} + 12 X^{2} Y^{2} Z^{3} + 8 X Y^{3} Z^{3} + 80 X^{2} Y^{3} Z + 796 X^{2} Y^{2} Z^{2} + 64 X Y^{3} Z^{2} + 12 X^{2} Y Z^{2} + 88 X Y^{3} Z + 24 X Y^{2} Z^{2} + 24 X Y Z^{3} + 240 X^{2} Y Z + 324 X Y^{2} Z + 192 X Y Z^{2} + 264 X Y Z

Algorithm definition

The algorithm ⟨10×21×24:3000⟩ is the (Kronecker) tensor product of ⟨2×3×4:20⟩ with ⟨5×7×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