Description of fast matrix multiplication algorithm: ⟨12×14×20:2016⟩

Algorithm type

48 X^{4} Y^{6} Z^{8} + 120 X^{4} Y^{4} Z^{8} + 48 X^{4} Y^{2} Z^{8} + 16 X^{2} Y^{8} Z^{4} + 48 X^{2} Y^{3} Z^{8} + 96 X^{2} Y^{6} Z^{4} + 120 X^{2} Y^{2} Z^{8} + 48 X^{2} Y Z^{8} + 96 X^{2} Y^{4} Z^{4} + 16 X Y^{4} Z^{4} + 80 X^{2} Y^{2} Z^{4} + 96 X Y^{3} Z^{4} + 96 X^{2} Y^{3} Z^{2} + 96 X Y^{2} Z^{4} + 240 X^{2} Y^{2} Z^{2} + 32 X Y^{4} Z + 80 X Y Z^{4} + 96 X^{2} Y Z^{2} + 192 X Y^{3} Z + 192 X Y^{2} Z + 160 X Y Z

Algorithm definition

The algorithm ⟨12×14×20:2016⟩ is the (Kronecker) tensor product of ⟨3×7×4:63⟩ with ⟨4×2×5:32⟩.

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