Description of fast matrix multiplication algorithm: ⟨15×21×30:5080⟩

Algorithm type

16 X^{4} Y^{6} Z^{9} + 24 X^{2} Y^{6} Z^{9} + 752 X^{4} Y^{6} Z^{6} + 1128 X^{2} Y^{6} Z^{6} + 48 X^{2} Y^{3} Z^{9} + 16 X^{4} Y^{3} Z^{6} + 72 X Y^{3} Z^{9} + 16 X^{6} Y^{3} Z^{3} + 320 X^{2} Y^{6} Z^{3} + 168 X^{2} Y^{3} Z^{6} + 304 X^{4} Y^{3} Z^{3} + 480 X Y^{6} Z^{3} + 216 X Y^{3} Z^{6} + 24 X^{3} Y^{3} Z^{3} + 872 X^{2} Y^{3} Z^{3} + 624 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨15×21×30:5080⟩ is the (Kronecker) tensor product of ⟨5×7×5:127⟩ with ⟨3×3×6: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