Description of fast matrix multiplication algorithm: ⟨7×10×32:1472⟩

Algorithm type

80 X^{4} Y^{8} Z^{4} + 16 X^{2} Y^{8} Z^{4} + 64 X^{2} Y^{8} Z^{2} + 96 X^{2} Y^{4} Z^{4} + 16 X Y^{4} Z^{4} + 192 X^{2} Y^{4} Z^{2} + 48 X^{2} Y^{2} Z^{4} + 48 X Y^{4} Z^{3} + 48 X Y^{4} Z^{2} + 112 X^{2} Y^{2} Z^{2} + 176 X Y^{4} Z + 96 X Y Z^{4} + 48 X Y Z^{3} + 96 X Y Z^{2} + 336 X Y Z

Algorithm definition

The algorithm ⟨7×10×32:1472⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨7×10×16:736⟩.

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