Description of fast matrix multiplication algorithm: ⟨3×16×30:1065⟩

Algorithm type

6 X^{3} Y^{2} Z^{3} + 48 X^{2} Y^{3} Z^{2} + 24 X^{3} Y^{2} Z + 6 X^{3} Y Z^{2} + 321 X^{2} Y^{2} Z^{2} + 6 X^{2} Y Z^{3} + 78 X^{3} Y Z + 96 X^{2} Y^{2} Z + 48 X Y^{3} Z + 6 X Y Z^{3} + 150 X^{2} Y Z + 180 X Y^{2} Z + 6 X Y Z^{2} + 90 X Y Z

Algorithm definition

The algorithm ⟨3×16×30:1065⟩ is the (Kronecker) tensor product of ⟨1×1×3:3⟩ with ⟨3×16×10:355⟩.

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