Description of fast matrix multiplication algorithm: ⟨23×24×24:6902⟩

Algorithm type

[[1, 1, 1]$94,[1, 1, 2]$114,[1, 1, 3]$990,[1, 2, 1]$24,[1, 2, 2]$11,[1, 3, 1]$22,[2, 2, 1]$58,[2, 2, 2]$308,[2, 2, 3]$231,[2, 3, 1]$67,[2, 3, 2]$682,[3, 2, 1]$22,[3, 2, 2]$231,[3, 3, 1]$968,[3, 3, 3]$3080]

Algorithm definition

The algorithm ⟨23×24×24:6902⟩ is the projection [[1, 0], [0]] of ⟨24×24×24:7000⟩.

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