Description of fast matrix multiplication algorithm: ⟨10×12×18:1336⟩

Algorithm type

128 X^{6} Y^{6} Z^{4} + 88 X^{6} Y^{6} Z^{3} + 96 X^{6} Y^{6} Z^{2} + 8 X^{6} Y^{6} Z + 64 X^{3} Y^{3} Z^{5} + 128 X^{3} Y^{3} Z^{4} + 352 X^{3} Y^{3} Z^{3} + 42 X^{2} Y^{2} Z^{5} + 184 X^{3} Y^{3} Z^{2} + 30 X^{2} Y^{2} Z^{4} + 72 X^{3} Y^{3} Z + 48 X^{2} Y Z^{3} + 48 X Y^{2} Z^{3} + 12 X^{2} Y Z^{2} + 12 X Y^{2} Z^{2} + 12 X^{2} Y Z + 12 X Y^{2} Z

Algorithm definition

The algorithm ⟨10×12×18:1336⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨10×12×9:668⟩.

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