Description of fast matrix multiplication algorithm: ⟨9×15×23:1880⟩

Algorithm type

208 X^{4} Y^{6} Z^{6} + 32 X^{2} Y^{9} Z^{3} + 328 X^{2} Y^{6} Z^{6} + 48 X^{2} Y^{3} Z^{9} + 32 X^{4} Y^{6} Z^{3} + 48 X Y^{9} Z^{3} + 24 X Y^{6} Z^{6} + 72 X Y^{3} Z^{9} + 64 X^{6} Y^{3} Z^{3} + 176 X^{2} Y^{6} Z^{3} + 48 X^{2} Y^{3} Z^{6} + 96 X^{4} Y^{3} Z^{3} + 192 X Y^{6} Z^{3} + 72 X Y^{3} Z^{6} + 96 X^{3} Y^{3} Z^{3} + 224 X^{2} Y^{3} Z^{3} + 120 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨9×15×23:1880⟩ is the projection [[0, 0], [24]] of ⟨9×15×24:1880⟩.

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