Description of fast matrix multiplication algorithm: ⟨25×26×26:8552⟩

Algorithm type

[[1, 1, 1]$102,[1, 1, 2]$124,[1, 1, 3]$1176,[1, 2, 1]$26,[1, 2, 2]$12,[1, 3, 1]$24,[2, 2, 1]$63,[2, 2, 2]$360,[2, 2, 3]$276,[2, 3, 1]$73,[2, 3, 2]$816,[3, 2, 1]$24,[3, 2, 2]$276,[3, 3, 1]$1152,[3, 3, 3]$4048]

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