Description of fast matrix multiplication algorithm: ⟨4×28×32:2288⟩

Algorithm type

4 X Y^{21} Z + 8 X Y^{18} Z + 12 X^{2} Y^{14} Z^{2} + 4 X Y^{15} Z + 24 X^{2} Y^{12} Z^{2} + 16 X Y^{14} Z + 48 X^{4} Y^{6} Z^{4} + 12 X^{2} Y^{10} Z^{2} + 36 X Y^{12} Z + 16 X^{2} Y^{9} Z^{2} + 96 X^{4} Y^{4} Z^{4} + 12 X^{2} Y^{8} Z^{2} + 16 X Y^{10} Z + 20 X Y^{9} Z + 156 X^{2} Y^{6} Z^{2} + 16 X Y^{8} Z + 20 X Y^{7} Z + 188 X^{2} Y^{4} Z^{2} + 140 X Y^{6} Z + 80 X^{2} Y^{3} Z^{2} + 20 X Y^{5} Z + 364 X^{2} Y^{2} Z^{2} + 100 X Y^{4} Z + 168 X Y^{3} Z + 372 X Y^{2} Z + 340 X Y Z

Algorithm definition

The algorithm ⟨4×28×32:2288⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ with ⟨2×7×8:88⟩.

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