Description of fast matrix multiplication algorithm: ⟨4×7×32:656⟩

Algorithm type

12 X^{4} Y^{4} Z^{4} + 4 X^{4} Y^{3} Z^{4} + 8 X^{3} Y^{3} Z^{4} + 8 X^{2} Y^{5} Z^{2} + 16 X^{2} Y^{4} Z^{2} + 8 X^{2} Y^{3} Z^{2} + 152 X^{2} Y^{2} Z^{2} + 8 X Y^{3} Z^{2} + 8 X^{2} Y Z^{2} + 72 X Y^{3} Z + 96 X Y^{2} Z + 264 X Y Z

Algorithm definition

The algorithm ⟨4×7×32:656⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨4×7×16:328⟩.

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