Description of fast matrix multiplication algorithm: ⟨9×10×18:1050⟩

Algorithm type

48 X^{4} Y^{6} Z^{6} + 72 X^{2} Y^{6} Z^{6} + 18 X^{4} Y^{4} Z^{4} + 96 X^{2} Y^{3} Z^{6} + 144 X Y^{3} Z^{6} + 96 X^{2} Y^{3} Z^{3} + 72 X^{2} Y^{2} Z^{4} + 144 X Y^{3} Z^{3} + 72 X^{2} Y^{2} Z^{2} + 72 X Y Z^{4} + 144 X Y Z^{2} + 72 X Y Z

Algorithm definition

The algorithm ⟨9×10×18:1050⟩ is the (Kronecker) tensor product of ⟨3×2×3:15⟩ with ⟨3×5×6:70⟩.

Algorithm description

maple tensor 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