Description of fast matrix multiplication algorithm: ⟨10×12×16:1190⟩

Algorithm type

70 X^{4} Y^{4} Z^{4} + 3 X^{2} Y^{6} Z^{2} + 2 X^{2} Y^{4} Z^{4} + X^{2} Y^{2} Z^{6} + 15 X^{4} Y^{2} Z^{2} + 29 X^{2} Y^{4} Z^{2} + 24 X^{2} Y^{2} Z^{4} + 446 X^{2} Y^{2} Z^{2} + 18 X Y^{3} Z + 12 X Y^{2} Z^{2} + 6 X Y Z^{3} + 90 X^{2} Y Z + 174 X Y^{2} Z + 144 X Y Z^{2} + 156 X Y Z

Algorithm definition

The algorithm ⟨10×12×16:1190⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨5×6×8:170⟩.

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