Description of fast matrix multiplication algorithm: ⟨18×24×24:5600⟩

Algorithm type

64 X^{12} Y^{12} Z^{8} + 96 X^{12} Y^{12} Z^{4} + 64 X^{6} Y^{6} Z^{12} + 96 X^{6} Y^{6} Z^{6} + 576 X^{6} Y^{6} Z^{4} + 864 X^{6} Y^{6} Z^{2} + 384 X^{3} Y^{3} Z^{6} + 576 X^{3} Y^{3} Z^{3} + 1152 X^{3} Y^{3} Z^{2} + 1728 X^{3} Y^{3} Z

Algorithm definition

The algorithm ⟨18×24×24:5600⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨9×12×12:800⟩.

Algorithm description

maple tensor representation (compressed by bzip2);
maple LRP 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