Description of fast matrix multiplication algorithm: ⟨26×30×30:12202⟩

Algorithm type

[[1, 1, 1]$112,[1, 1, 2]$282,[1, 1, 3]$1278,[1, 2, 1]$120,[1, 2, 2]$44,[1, 3, 1]$400,[2, 2, 1]$100,[2, 2, 2]$542,[2, 2, 3]$264,[2, 3, 1]$226,[2, 3, 2]$2620,[3, 2, 1]$22,[3, 2, 2]$264,[3, 3, 1]$1256,[3, 3, 3]$4672]

Algorithm definition

The algorithm ⟨26×30×30:12202⟩ 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