Description of fast matrix multiplication algorithm: ⟨16×24×32:6720⟩

Algorithm type

64 X^{8} Y^{8} Z^{8} + 64 X^{4} Y^{12} Z^{4} + 704 X^{4} Y^{4} Z^{4} + 512 X^{2} Y^{6} Z^{2} + 2304 X^{2} Y^{2} Z^{2} + 768 X Y^{3} Z + 2304 X Y Z

Algorithm definition

The algorithm ⟨16×24×32:6720⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨8×12×16:960⟩.

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