Description of fast matrix multiplication algorithm: ⟨18×18×18:3200⟩

Algorithm type

512 X^{6} Y^{6} Z^{9} + 768 X^{6} Y^{3} Z^{9} + 768 X^{3} Y^{6} Z^{9} + 1152 X^{3} Y^{3} Z^{9}

Algorithm definition

The algorithm ⟨18×18×18:3200⟩ is the (Kronecker) tensor product of ⟨3×3×6:40⟩ with ⟨6×6×3:80⟩.

Algorithm description

maple tensor representation (compressed by bzip2);
maple LRP 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