Description of fast matrix multiplication algorithm: ⟨12×16×24:2730⟩

Algorithm type

18 X^{8} Y^{8} Z^{8} + 6 X^{4} Y^{12} Z^{4} + 24 X^{4} Y^{8} Z^{4} + 36 X^{4} Y^{4} Z^{8} + 174 X^{4} Y^{4} Z^{4} + 12 X^{2} Y^{6} Z^{4} + 48 X^{2} Y^{6} Z^{2} + 48 X^{2} Y^{4} Z^{4} + 192 X^{2} Y^{4} Z^{2} + 276 X^{2} Y^{2} Z^{4} + 456 X^{2} Y^{2} Z^{2} + 72 X Y^{3} Z^{2} + 72 X Y^{3} Z + 288 X Y^{2} Z^{2} + 288 X Y^{2} Z + 360 X Y Z^{2} + 360 X Y Z

Algorithm definition

The algorithm ⟨12×16×24:2730⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨6×8×12:390⟩.

Algorithm description

maple tensor 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