Description of fast matrix multiplication algorithm: ⟨20 × 20 × 20:4340⟩

Algorithm type

[[1, 1, 1]$80,[1, 1, 2]$60,[1, 1, 3]$740,[2, 2, 1]$40,[2, 2, 2]$200,[2, 2, 3]$180,[2, 3, 1]$20,[2, 3, 2]$180,[3, 2, 1]$20,[3, 2, 2]$180,[3, 3, 1]$720,[3, 3, 3]$1920]

Algorithm definition

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