Description of fast matrix multiplication algorithm: ⟨25×30×30:12060⟩

Algorithm type

[[1, 1, 1]$110,[1, 1, 2]$320,[1, 1, 3]$1180,[1, 2, 1]$150,[1, 2, 2]$50,[1, 3, 1]$600,[2, 2, 1]$105,[2, 2, 2]$560,[2, 2, 3]$230,[2, 3, 1]$265,[2, 3, 2]$2940,[3, 2, 1]$20,[3, 2, 2]$230,[3, 3, 1]$1160,[3, 3, 3]$4140]

Algorithm definition

The algorithm ⟨25×30×30:12060⟩ 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