Description of fast matrix multiplication algorithm: ⟨2×15×32:736⟩

Algorithm type

4 X Y^{15} Z + 4 X Y^{14} Z + 4 X Y^{13} Z + 8 X Y^{12} Z + 4 X Y^{11} Z + 4 X Y^{10} Z + 4 X Y^{9} Z + 4 X Y^{8} Z + 12 X Y^{7} Z + 8 X Y^{6} Z + 96 X^{2} Y^{3} Z^{2} + 16 X Y^{5} Z + 128 X^{2} Y^{2} Z^{2} + 8 X Y^{4} Z + 8 X Y^{3} Z + 100 X Y^{2} Z + 324 X Y Z

Algorithm definition

The algorithm ⟨2×15×32:736⟩ is the (Kronecker) tensor product of ⟨2×15×16:368⟩ with ⟨1×1×2:2⟩.

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