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

Algorithm type

48 X^{8} Y^{12} Z^{12} + 72 X^{4} Y^{12} Z^{12} + 96 X^{8} Y^{6} Z^{6} + 528 X^{4} Y^{6} Z^{6} + 576 X^{2} Y^{6} Z^{6} + 576 X^{4} Y^{3} Z^{3} + 1440 X^{2} Y^{3} Z^{3} + 864 X Y^{3} Z^{3}

Algorithm definition

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

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