Description of fast matrix multiplication algorithm: ⟨3×16×32:1152⟩

Algorithm type

4 X Y^{9} Z + 72 X^{3} Y^{4} Z^{3} + 24 X^{2} Y^{6} Z^{2} + 12 X Y^{6} Z^{2} + 96 X^{2} Y^{4} Z^{2} + 32 X Y^{6} Z + 24 X^{2} Y^{4} Z + 120 X^{2} Y^{2} Z^{2} + 88 X Y^{4} Z + 12 X^{2} Y^{2} Z + 72 X Y^{3} Z + 36 X Y^{2} Z^{2} + 300 X Y^{2} Z + 260 X Y Z

Algorithm definition

The algorithm ⟨3×16×32:1152⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨3×16×16:576⟩.

Algorithm description

maple tensor 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