Description of fast matrix multiplication algorithm: ⟨9×21×24:2640⟩

Algorithm type

32 X^{4} Y^{9} Z^{6} + 16 X^{6} Y^{6} Z^{6} + 16 X^{2} Y^{12} Z^{3} + 48 X^{2} Y^{9} Z^{6} + 240 X^{4} Y^{6} Z^{6} + 24 X Y^{12} Z^{3} + 24 X^{3} Y^{6} Z^{6} + 64 X^{2} Y^{9} Z^{3} + 360 X^{2} Y^{6} Z^{6} + 96 X Y^{9} Z^{3} + 224 X^{2} Y^{6} Z^{3} + 64 X^{4} Y^{3} Z^{3} + 336 X Y^{6} Z^{3} + 496 X^{2} Y^{3} Z^{3} + 600 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨9×21×24:2640⟩ is the (Kronecker) tensor product of ⟨3×3×6:40⟩ with ⟨3×7×4:66⟩.

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