Description of fast matrix multiplication algorithm: ⟨6×20×28:2016⟩

Algorithm type

48 X^{4} Y^{12} Z^{4} + 16 X^{2} Y^{16} Z^{2} + 16 X Y^{16} Z + 120 X^{4} Y^{8} Z^{4} + 144 X^{2} Y^{12} Z^{2} + 96 X Y^{12} Z + 48 X^{4} Y^{4} Z^{4} + 216 X^{2} Y^{8} Z^{2} + 96 X Y^{8} Z + 128 X^{2} Y^{4} Z^{2} + 96 X^{2} Y^{3} Z^{2} + 240 X^{2} Y^{2} Z^{2} + 112 X Y^{4} Z + 96 X^{2} Y Z^{2} + 192 X Y^{3} Z + 192 X Y^{2} Z + 160 X Y Z

Algorithm definition

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

Algorithm description

maple tensor representation (compressed by bzip2);
maple LRP representation (compressed by bzip2);
maple evaluation scheme (compressed by bzip2).

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