Description of fast matrix multiplication algorithm: ⟨27×30×30:12336⟩

Algorithm type

[[1, 1, 1]$114,[1, 1, 2]$240,[1, 1, 3]$1380,[1, 2, 1]$90,[1, 2, 2]$36,[1, 3, 1]$234,[2, 2, 1]$93,[2, 2, 2]$522,[2, 2, 3]$300,[2, 3, 1]$183,[2, 3, 2]$2214,[3, 2, 1]$24,[3, 2, 2]$300,[3, 3, 1]$1356,[3, 3, 3]$5250]

Algorithm definition

The algorithm ⟨27×30×30:12336⟩ 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