Description of fast matrix multiplication algorithm: ⟨3×6×8:110⟩

Algorithm type

32 X^{2} Y^{3} Z^{3} + 48 X Y^{3} Z^{3} + 6 X^{2} Y^{2} Z^{2} + 12 X^{2} Y Z + 12 X Y Z

Algorithm definition

The algorithm ⟨3×6×8:110⟩ is the (Kronecker) tensor product of ⟨1×2×1:2⟩ with ⟨3×3×8:55⟩.

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