Description of fast matrix multiplication algorithm: ⟨9×18×27:2520⟩

Algorithm type

256 X^{6} Y^{9} Z^{6} + 384 X^{6} Y^{9} Z^{3} + 384 X^{3} Y^{9} Z^{6} + 64 X^{6} Y^{6} Z^{4} + 576 X^{3} Y^{9} Z^{3} + 32 X^{9} Y^{3} Z^{2} + 96 X^{6} Y^{6} Z^{2} + 32 X^{3} Y^{9} Z^{2} + 48 X^{9} Y^{3} Z + 48 X^{3} Y^{9} Z + 32 X^{3} Y^{3} Z^{6} + 48 X^{3} Y^{3} Z^{3} + 208 X^{3} Y^{3} Z^{2} + 312 X^{3} Y^{3} Z

Algorithm definition

The algorithm ⟨9×18×27:2520⟩ is the (Kronecker) tensor product of ⟨3×3×9:63⟩ with ⟨3×6×3:40⟩.

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