Description of fast matrix multiplication algorithm: ⟨6×18×30:1920⟩

Algorithm type

16 X^{4} Y^{12} Z^{6} + 16 X^{2} Y^{15} Z^{3} + 24 X^{2} Y^{12} Z^{6} + 80 X^{4} Y^{9} Z^{6} + 24 X Y^{15} Z^{3} + 96 X^{2} Y^{12} Z^{3} + 120 X^{2} Y^{9} Z^{6} + 96 X^{4} Y^{6} Z^{6} + 144 X Y^{12} Z^{3} + 128 X^{2} Y^{9} Z^{3} + 144 X^{2} Y^{6} Z^{6} + 192 X Y^{9} Z^{3} + 128 X^{2} Y^{6} Z^{3} + 192 X Y^{6} Z^{3} + 208 X^{2} Y^{3} Z^{3} + 312 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨6×18×30:1920⟩ is the (Kronecker) tensor product of ⟨2×6×5:48⟩ with ⟨3×3×6:40⟩.

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