Description of fast matrix multiplication algorithm: ⟨4×20×21:1100⟩

Algorithm type

8 X^{2} Y^{15} Z^{2} + 8 X^{4} Y^{10} Z^{4} + 24 X Y^{15} Z + 8 X^{4} Y^{8} Z^{4} + 8 X^{2} Y^{12} Z^{2} + 4 X^{4} Y^{6} Z^{4} + 24 X^{2} Y^{10} Z^{2} + 28 X Y^{12} Z + 4 X^{2} Y^{9} Z^{2} + 40 X^{4} Y^{4} Z^{4} + 28 X^{2} Y^{8} Z^{2} + 16 X Y^{9} Z + 4 X^{4} Y^{2} Z^{4} + 56 X^{2} Y^{6} Z^{2} + 24 X^{2} Y^{5} Z^{2} + 48 X^{2} Y^{4} Z^{2} + 8 X^{2} Y^{2} Z^{4} + 24 X Y^{6} Z + 16 X^{2} Y^{3} Z^{2} + 72 X Y^{5} Z + 176 X^{2} Y^{2} Z^{2} + 84 X Y^{4} Z + 8 X Y^{3} Z^{2} + 12 X^{2} Y Z^{2} + 104 X Y^{3} Z + 72 X Y^{2} Z + 24 X Y Z^{2} + 168 X Y Z

Algorithm definition

The algorithm ⟨4×20×21:1100⟩ is the (Kronecker) tensor product of ⟨2×4×3:20⟩ with ⟨2×5×7:55⟩.

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