Description of fast matrix multiplication algorithm: ⟨3×18×26:1042⟩

Algorithm type

12 X^{2} Y^{4} Z^{2} + 194 X^{2} Y^{3} Z^{3} + 6 X Y^{6} Z + 32 X^{2} Y^{3} Z^{2} + 2 X^{2} Y^{2} Z^{3} + 4 X Y^{5} Z + 2 X Y^{4} Z^{2} + 288 X Y^{3} Z^{3} + 146 X^{2} Y^{2} Z^{2} + 14 X Y^{4} Z + 2 X Y^{3} Z^{2} + 2 X Y^{2} Z^{3} + 24 X^{3} Y Z + 38 X Y^{3} Z + 58 X Y^{2} Z^{2} + 20 X Y Z^{3} + 12 X^{2} Y Z + 96 X Y^{2} Z + 80 X Y Z^{2} + 10 X Y Z

Algorithm definition

The algorithm ⟨3×18×26:1042⟩ is the (Kronecker) tensor product of ⟨3×9×26:521⟩ with ⟨1×2×1: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