Description of fast matrix multiplication algorithm: ⟨12×12×32:2640⟩

Algorithm type

256 X^{4} Y^{6} Z^{6} + 384 X^{2} Y^{6} Z^{6} + 48 X^{4} Y^{4} Z^{4} + 96 X^{4} Y^{2} Z^{2} + 512 X^{2} Y^{3} Z^{3} + 768 X Y^{3} Z^{3} + 192 X^{2} Y^{2} Z^{2} + 192 X^{2} Y Z + 192 X Y Z

Algorithm definition

The algorithm ⟨12×12×32:2640⟩ is the (Kronecker) tensor product of ⟨3×3×8:55⟩ with ⟨4×4×4:48⟩.

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