Description of fast matrix multiplication algorithm: ⟨2 × 5 × 30:240⟩

Algorithm type

[[1, 1, 1]$96,[1, 2, 1]$60,[1, 3, 1]$24,[2, 2, 2]$60]

Algorithm definition

The algorithm ⟨2 × 5 × 30:240⟩ is the (Kronecker) tensor product of ⟨1 × 1 × 3:3⟩ with ⟨2 × 5 × 10:80⟩.

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