Description of fast matrix multiplication algorithm: ⟨4×20×28:1430⟩

Algorithm type

4 X^{2} Y^{15} Z^{2} + 12 X^{4} Y^{10} Z^{4} + 12 X Y^{15} Z + 12 X^{4} Y^{8} Z^{4} + 4 X^{2} Y^{12} Z^{2} + 6 X^{4} Y^{6} Z^{4} + 52 X^{2} Y^{10} Z^{2} + 14 X Y^{12} Z + 2 X^{2} Y^{9} Z^{2} + 60 X^{4} Y^{4} Z^{4} + 58 X^{2} Y^{8} Z^{2} + 48 X Y^{10} Z + 8 X Y^{9} Z + 6 X^{4} Y^{2} Z^{4} + 52 X^{2} Y^{6} Z^{2} + 56 X Y^{8} Z + 20 X^{2} Y^{5} Z^{2} + 136 X^{2} Y^{4} Z^{2} + 12 X^{2} Y^{2} Z^{4} + 44 X Y^{6} Z + 12 X^{2} Y^{3} Z^{2} + 60 X Y^{5} Z + 192 X^{2} Y^{2} Z^{2} + 118 X Y^{4} Z + 4 X Y^{3} Z^{2} + 10 X^{2} Y Z^{2} + 68 X Y^{3} Z + 16 X Y^{2} Z^{2} + 172 X Y^{2} Z + 20 X Y Z^{2} + 140 X Y Z

Algorithm definition

The algorithm ⟨4×20×28:1430⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ 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