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

Algorithm type

96 X^{8} Y^{8} Z^{8} + 32 X^{4} Y^{12} Z^{4} + 128 X^{4} Y^{8} Z^{4} + 928 X^{4} Y^{4} Z^{4} + 256 X^{2} Y^{6} Z^{2} + 1024 X^{2} Y^{4} Z^{2} + 2432 X^{2} Y^{2} Z^{2} + 384 X Y^{3} Z + 1536 X Y^{2} Z + 1920 X Y Z

Algorithm definition

The algorithm ⟨16×32×32:8736⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨8×16×16:1248⟩.

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