Description of fast matrix multiplication algorithm: ⟨3×12×13:352⟩

Algorithm type

96 X^{3} Y^{3} Z^{2} + 144 X^{3} Y^{3} Z + 4 X^{2} Y^{3} Z^{2} + 28 X^{2} Y^{2} Z^{2} + 28 X^{2} Y Z + 12 X Y^{2} Z + 40 X Y Z

Algorithm definition

The algorithm ⟨3×12×13:352⟩ is the (Kronecker) tensor product of ⟨3×6×13:176⟩ with ⟨1×2×1:2⟩.

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