Description of fast matrix multiplication algorithm: ⟨12×12×32:2695⟩

Algorithm type

16 X^{8} Y^{12} Z^{12} + 24 X^{4} Y^{12} Z^{12} + 3 X^{8} Y^{8} Z^{8} + 6 X^{8} Y^{4} Z^{4} + 192 X^{4} Y^{6} Z^{6} + 288 X^{2} Y^{6} Z^{6} + 42 X^{4} Y^{4} Z^{4} + 72 X^{4} Y^{2} Z^{2} + 576 X^{2} Y^{3} Z^{3} + 864 X Y^{3} Z^{3} + 180 X^{2} Y^{2} Z^{2} + 216 X^{2} Y Z + 216 X Y Z

Algorithm definition

The algorithm ⟨12×12×32:2695⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨6×6×16:385⟩.

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