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

Algorithm type

16 X^{8} Y^{12} Z^{12} + 24 X^{4} Y^{12} Z^{12} + 288 X^{4} Y^{6} Z^{6} + 432 X^{2} Y^{6} Z^{6} + 32 X^{2} Y^{3} Z^{9} + 48 X Y^{3} Z^{9} + 128 X^{2} Y^{3} Z^{6} + 192 X Y^{3} Z^{6} + 736 X^{2} Y^{3} Z^{3} + 1104 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨12×18×24:3000⟩ is the (Kronecker) tensor product of ⟨3×3×6:40⟩ with ⟨4×6×4:75⟩.

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