Description of fast matrix multiplication algorithm: ⟨10×12×24:1750⟩

Algorithm type

16 X^{8} Y^{12} Z^{10} + 24 X^{4} Y^{12} Z^{10} + 48 X^{4} Y^{6} Z^{6} + 96 X^{4} Y^{6} Z^{5} + 72 X^{2} Y^{6} Z^{6} + 144 X^{2} Y^{6} Z^{5} + 18 X^{4} Y^{4} Z^{4} + 36 X^{2} Y^{4} Z^{2} + 288 X^{2} Y^{3} Z^{3} + 432 X Y^{3} Z^{3} + 144 X^{2} Y^{2} Z^{2} + 216 X Y^{2} Z + 216 X Y Z

Algorithm definition

The algorithm ⟨10×12×24:1750⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨5×6×12:250⟩.

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