Description of fast matrix multiplication algorithm: ⟨16×28×32:7728⟩

Algorithm type

80 X^{8} Y^{8} Z^{8} + 192 X^{4} Y^{8} Z^{4} + 736 X^{4} Y^{4} Z^{4} + 192 X^{2} Y^{8} Z^{2} + 192 X^{2} Y^{6} Z^{2} + 576 X^{2} Y^{4} Z^{2} + 2304 X^{2} Y^{2} Z^{2} + 384 X Y^{4} Z + 384 X Y^{3} Z + 384 X Y^{2} Z + 2304 X Y Z

Algorithm definition

The algorithm ⟨16×28×32:7728⟩ is the (Kronecker) tensor product of ⟨4×4×4:48⟩ with ⟨4×7×8:161⟩.

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