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

Algorithm type

48 X^{12} Y^{12} Z^{8} + 72 X^{12} Y^{12} Z^{4} + 96 X^{6} Y^{6} Z^{8} + 816 X^{6} Y^{6} Z^{4} + 1008 X^{6} Y^{6} Z^{2} + 288 X^{6} Y^{3} Z^{2} + 432 X^{6} Y^{3} Z + 864 X^{3} Y^{3} Z^{4} + 1872 X^{3} Y^{3} Z^{2} + 864 X^{3} Y^{3} Z

Algorithm definition

The algorithm ⟨18×24×27:6360⟩ is the (Kronecker) tensor product of ⟨6×4×9:159⟩ with ⟨3×6×3:40⟩.

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