Description of fast matrix multiplication algorithm: ⟨3×10×18:408⟩

Algorithm type

96 X^{2} Y^{3} Z^{3} + 6 X^{2} Y^{3} Z^{2} + 144 X Y^{3} Z^{3} + 42 X^{2} Y^{2} Z^{2} + 18 X Y^{2} Z + 42 X Y Z^{2} + 60 X Y Z

Algorithm definition

The algorithm ⟨3×10×18:408⟩ is the (Kronecker) tensor product of ⟨3×10×6:136⟩ with ⟨1×1×3:3⟩.

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