Description of fast matrix multiplication algorithm: ⟨21×21×22:5430⟩

Algorithm type

[[1, 1, 1]$87,[1, 1, 2]$97,[1, 1, 3]$783,[1, 2, 1]$22,[1, 2, 2]$10,[1, 3, 1]$18,[2, 1, 1]$2,[2, 1, 2]$23,[2, 1, 3]$18,[2, 2, 1]$91,[2, 2, 2]$319,[2, 2, 3]$172,[2, 3, 1]$57,[2, 3, 2]$478,[3, 1, 2]$9,[3, 2, 1]$57,[3, 2, 2]$181,[3, 2, 3]$306,[3, 3, 1]$726,[3, 3, 3]$1974]

Algorithm definition

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