Description of fast matrix multiplication algorithm: ⟨2 × 4 × 30:195⟩

Algorithm type

[[1, 1, 1]$90,[1, 2, 1]$35,[1, 3, 1]$15,[1, 4, 1]$10,[2, 2, 2]$35,[2, 3, 2]$10]

Algorithm definition

The algorithm ⟨2 × 4 × 30:195⟩ is the (Kronecker) tensor product of ⟨1 × 1 × 5:5⟩ with ⟨2 × 4 × 6:39⟩.

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