Description of fast matrix multiplication algorithm: ⟨4×18×30:1425⟩

Algorithm type


Algorithm definition

The algorithm ⟨4×18×30:1425⟩ is the (Kronecker) tensor product of ⟨2×3×5:25⟩ with ⟨2×6×6:57⟩.

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