Description of fast matrix multiplication algorithm: ⟨19×22×22:5288⟩

Algorithm type

[[1, 1, 1]$82,[1, 1, 2]$168,[1, 1, 3]$668,[1, 2, 1]$66,[1, 2, 2]$24,[1, 3, 1]$162,[2, 2, 1]$65,[2, 2, 2]$290,[2, 2, 3]$136,[2, 3, 1]$127,[2, 3, 2]$1030,[3, 2, 1]$16,[3, 2, 2]$136,[3, 3, 1]$652,[3, 3, 3]$1666]

Algorithm definition

The algorithm ⟨19×22×22:5288⟩ is taken from:

Optimization techniques for small matrix multiplication. Theoretical Computer Science, 412(22):2219--2236, May 2011. [ 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