Description of fast matrix multiplication algorithm: ⟨4×11×32:960⟩

Algorithm type

2 X^{4} Y^{5} Z^{4} + 36 X^{4} Y^{4} Z^{4} + 2 X^{3} Y^{5} Z^{4} + 2 X^{4} Y^{3} Z^{4} + 6 X^{2} Y^{7} Z^{2} + 8 X Y^{9} Z + 2 X^{3} Y^{3} Z^{4} + 48 X^{2} Y^{6} Z^{2} + 16 X^{2} Y^{5} Z^{2} + 24 X Y^{7} Z + 38 X^{2} Y^{4} Z^{2} + 12 X Y^{6} Z + 2 X Y^{5} Z^{2} + 10 X^{2} Y^{3} Z^{2} + 18 X Y^{5} Z + 206 X^{2} Y^{2} Z^{2} + 48 X Y^{4} Z + 2 X Y^{3} Z^{2} + 4 X^{2} Y Z^{2} + 154 X Y^{3} Z + 36 X Y^{2} Z + 284 X Y Z

Algorithm definition

The algorithm ⟨4×11×32:960⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨4×11×16:480⟩.

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