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

Algorithm type

9 X^{4} Y^{8} Z^{4} + 3 X^{2} Y^{12} Z^{2} + 15 X^{4} Y^{6} Z^{4} + 15 X^{2} Y^{10} Z^{2} + 6 X Y^{12} Z + 42 X^{4} Y^{4} Z^{4} + 30 X^{2} Y^{8} Z^{2} + 30 X Y^{10} Z + 60 X^{2} Y^{6} Z^{2} + 24 X Y^{8} Z + 153 X^{2} Y^{4} Z^{2} + 66 X Y^{6} Z + 30 X^{2} Y^{3} Z^{2} + 30 X Y^{5} Z + 165 X^{2} Y^{2} Z^{2} + 126 X Y^{4} Z + 60 X Y^{3} Z + 264 X Y^{2} Z + 162 X Y Z

Algorithm definition

The algorithm ⟨4×18×27:1290⟩ is the (Kronecker) tensor product of ⟨2×3×3:15⟩ with ⟨2×6×9:86⟩.

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