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

Algorithm type

144 X^{4} Y^{8} Z^{4} + 144 X^{2} Y^{8} Z^{2} + 144 X^{4} Y^{4} Z^{2} + 144 X^{2} Y^{4} Z^{4} + 144 X^{2} Y^{4} Z + 144 X Y^{4} Z^{2} + 288 X^{2} Y^{2} Z^{2} + 288 X^{2} Y Z + 288 X Y Z^{2}

Algorithm definition

The algorithm ⟨12×12×20:1728⟩ is the (Kronecker) tensor product of ⟨2×4×5:32⟩ with ⟨6×3×4:54⟩.

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