Description of fast matrix multiplication algorithm: ⟨4×27×27:1890⟩

Algorithm type

108 X^{4} Y^{4} Z^{4} + 36 X^{2} Y^{6} Z^{2} + 270 X^{2} Y^{4} Z^{2} + 72 X Y^{6} Z + 396 X^{2} Y^{2} Z^{2} + 108 X Y^{4} Z + 72 X Y^{3} Z + 468 X Y^{2} Z + 360 X Y Z

Algorithm definition

The algorithm ⟨4×27×27:1890⟩ is the (Kronecker) tensor product of ⟨2×3×3:15⟩ with ⟨2×9×9:126⟩.

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