Description of fast matrix multiplication algorithm: ⟨4×6×18:315⟩

Algorithm type


Algorithm definition

The algorithm ⟨4×6×18:315⟩ is the (Kronecker) tensor product of ⟨1×1×3:3⟩ with ⟨4×6×6:105⟩.

Algorithm description

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