Description of fast matrix multiplication algorithm: ⟨20×22×22:5384⟩

Algorithm type

[[1, 1, 1]$84,[1, 1, 2]$138,[1, 1, 3]$742,[1, 2, 1]$44,[1, 2, 2]$18,[1, 3, 1]$76,[2, 2, 1]$60,[2, 2, 2]$276,[2, 2, 3]$162,[2, 3, 1]$96,[2, 3, 2]$828,[3, 2, 1]$18,[3, 2, 2]$162,[3, 3, 1]$724,[3, 3, 3]$1956]

Algorithm definition

The algorithm ⟨20×22×22:5384⟩ 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