Description of fast matrix multiplication algorithm: ⟨3×13×30:880⟩

Algorithm type

240 X^{2} Y^{3} Z^{3} + 10 X^{2} Y^{3} Z^{2} + 360 X Y^{3} Z^{3} + 70 X^{2} Y^{2} Z^{2} + 30 X Y^{2} Z + 70 X Y Z^{2} + 100 X Y Z

Algorithm definition

The algorithm ⟨3×13×30:880⟩ is the (Kronecker) tensor product of ⟨3×13×6:176⟩ with ⟨1×1×5:5⟩.

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