Description of fast matrix multiplication algorithm: ⟨9×12×16:1100⟩

Algorithm type

64 X^{4} Y^{6} Z^{6} + 96 X^{2} Y^{6} Z^{6} + 64 X^{6} Y^{3} Z^{3} + 12 X^{4} Y^{4} Z^{4} + 12 X^{6} Y^{2} Z^{2} + 96 X^{3} Y^{3} Z^{3} + 24 X^{6} Y Z + 24 X^{4} Y^{2} Z^{2} + 192 X^{2} Y^{3} Z^{3} + 288 X Y^{3} Z^{3} + 60 X^{2} Y^{2} Z^{2} + 24 X^{3} Y Z + 72 X^{2} Y Z + 72 X Y Z

Algorithm definition

The algorithm ⟨9×12×16:1100⟩ is the (Kronecker) tensor product of ⟨3×3×8:55⟩ with ⟨3×4×2:20⟩.

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