Description of fast matrix multiplication algorithm: ⟨12×15×15:1600⟩

Algorithm type

160 X^{6} Y^{4} Z^{6} + 240 X^{6} Y^{2} Z^{6} + 64 X^{3} Y^{6} Z^{3} + 160 X^{3} Y^{4} Z^{3} + 96 X^{3} Y^{3} Z^{3} + 496 X^{3} Y^{2} Z^{3} + 384 X^{3} Y Z^{3}

Algorithm definition

The algorithm ⟨12×15×15:1600⟩ is the (Kronecker) tensor product of ⟨2×5×5:40⟩ with ⟨6×3×3: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