Description of fast matrix multiplication algorithm: ⟨4×5×22:330⟩

Algorithm type

2 X^{4} Y^{2} Z + 2 X^{3} Y^{2} Z^{2} + 12 X^{2} Y^{2} Z^{3} + 2 X^{3} Y^{2} Z + 4 X^{3} Y Z^{2} + 90 X^{2} Y^{2} Z^{2} + 4 X Y^{2} Z^{3} + 8 X^{2} Y^{2} Z + 8 X^{2} Y Z^{2} + 4 X Y^{3} Z + 4 X Y^{2} Z^{2} + 16 X Y Z^{3} + 16 X^{2} Y Z + 44 X Y^{2} Z + 52 X Y Z^{2} + 62 X Y Z

Algorithm definition

The algorithm ⟨4×5×22:330⟩ is the (Kronecker) tensor product of ⟨4×5×11:165⟩ with ⟨1×1×2:2⟩.

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