Description of fast matrix multiplication algorithm: ⟨24 × 27 × 27:9000⟩

Algorithm type

[[3, 1, 3]$864,[3, 2, 3]$2304,[3, 4, 3]$2016,[3, 8, 3]$576,[6, 2, 6]$864,[6, 4, 6]$1440,[6, 8, 6]$576,[12, 4, 12]$216,[12, 8, 12]$144]

Algorithm definition

The algorithm ⟨24 × 27 × 27:9000⟩ is the (Kronecker) tensor product of ⟨2 × 3 × 3:15⟩ with ⟨12 × 9 × 9:600⟩.

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