Description of fast matrix multiplication algorithm: ⟨2 × 9 × 24:336⟩

Algorithm type

[[1, 1, 1]$162,[1, 2, 1]$28,[1, 3, 1]$4,[1, 4, 1]$18,[1, 5, 1]$24,[1, 6, 1]$4,[2, 2, 2]$86,[2, 3, 2]$10]

Algorithm definition

The algorithm ⟨2 × 9 × 24:336⟩ is the (Kronecker) tensor product of ⟨1 × 1 × 2:2⟩ with ⟨2 × 9 × 12:168⟩.

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