Description of fast matrix multiplication algorithm: ⟨6×30×31:3380⟩

Algorithm type

320 X^{4} Y^{6} Z^{6} + 128 X^{2} Y^{9} Z^{3} + 480 X^{2} Y^{6} Z^{6} + 192 X Y^{9} Z^{3} + 320 X^{2} Y^{6} Z^{3} + 480 X Y^{6} Z^{3} + 512 X^{2} Y^{3} Z^{3} + 768 X Y^{3} Z^{3} + 180 X Y Z

Algorithm definition

The algorithm ⟨6×30×31:3380⟩ is the (Kronecker) tensor product of ⟨6×15×31:1690⟩ with ⟨1×2×1:2⟩.

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