Description of fast matrix multiplication algorithm: ⟨2 × 5 × 25:200⟩

Algorithm type

[[1, 1, 1]$80,[1, 2, 1]$50,[1, 3, 1]$20,[2, 2, 2]$50]

Algorithm definition

The algorithm ⟨2 × 5 × 25:200⟩ is the (Kronecker) tensor product of ⟨1 × 1 × 5:5⟩ with ⟨2 × 5 × 5:40⟩.

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