Description of fast matrix multiplication algorithm: ⟨8×15×23:1728⟩

Algorithm type

104 X^{4} Y^{8} Z^{4} + 40 X^{4} Y^{7} Z^{4} + 216 X^{2} Y^{8} Z^{2} + 72 X^{2} Y^{7} Z^{2} + 128 X^{2} Y^{4} Z^{4} + 112 X Y^{8} Z + 16 X^{2} Y^{3} Z^{4} + 32 X Y^{7} Z + 128 X Y^{4} Z^{2} + 278 X^{2} Y^{2} Z^{2} + 16 X Y^{3} Z^{2} + 10 X^{2} Y Z^{2} + 280 X Y^{2} Z + 284 X Y Z^{2} + 8 X Y Z

Algorithm definition

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

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