Description of fast matrix multiplication algorithm: ⟨4×7×20:406⟩

Algorithm type

16 X^{4} Y^{7} Z^{4} + 16 X^{2} Y^{7} Z^{2} + 48 X^{2} Y^{4} Z^{2} + 58 X^{2} Y^{2} Z^{2} + 48 X Y^{4} Z + 4 X^{2} Y Z^{2} + 12 X Y^{3} Z + 36 X Y^{2} Z + 168 X Y Z

Algorithm definition

The algorithm ⟨4×7×20:406⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨4×7×10:203⟩.

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