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

Algorithm type

135 X^{4} Y^{4} Z^{4} + 270 X^{4} Y^{2} Z^{2} + 90 X^{2} Y^{4} Z^{2} + 90 X^{2} Y^{2} Z^{4} + 300 X^{2} Y^{2} Z^{2} + 180 X^{2} Y^{2} Z + 180 X^{2} Y Z^{2} + 60 X^{2} Y Z + 180 X Y^{2} Z + 180 X Y Z^{2} + 60 X Y Z

Algorithm definition

The algorithm ⟨12×12×20:1725⟩ is the (Kronecker) tensor product of ⟨3×3×2:15⟩ with ⟨4×4×10:115⟩.

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