Description of fast matrix multiplication algorithm: ⟨5×5×32:576⟩

Algorithm type

224 X^{2} Y^{2} Z^{2} + 4 X^{3} Y Z + 8 X Y^{3} Z + 12 X Y^{2} Z^{2} + 8 X Y Z^{3} + 52 X^{2} Y Z + 96 X Y^{2} Z + 88 X Y Z^{2} + 84 X Y Z

Algorithm definition

The algorithm ⟨5×5×32:576⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨5×5×16:288⟩.

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