Description of fast matrix multiplication algorithm: ⟨11×11×22:1683⟩

Algorithm type

1100 X^{2} Y^{2} Z^{2} + 121 X^{2} Y Z + 231 X Y^{2} Z + 231 X Y Z^{2}

Algorithm definition

The algorithm ⟨11×11×22:1683⟩ is taken from:

Igor Kaporin. The aggregation and cancellation techniques as a practical tool for faster matrix multiplication. Theoretical Computer Science, 315:469--510, May 2004. [DOI]

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