Description of fast matrix multiplication algorithm: ⟨12×18×27:3320⟩

Algorithm type

400 X^{6} Y^{6} Z^{4} + 32 X^{9} Y^{3} Z^{2} + 600 X^{6} Y^{6} Z^{2} + 16 X^{3} Y^{9} Z^{2} + 48 X^{9} Y^{3} Z + 32 X^{6} Y^{3} Z^{4} + 24 X^{3} Y^{9} Z + 32 X^{3} Y^{3} Z^{6} + 112 X^{6} Y^{3} Z^{2} + 288 X^{3} Y^{6} Z^{2} + 96 X^{6} Y^{3} Z + 432 X^{3} Y^{6} Z + 352 X^{3} Y^{3} Z^{4} + 48 X^{3} Y^{3} Z^{3} + 640 X^{3} Y^{3} Z^{2} + 168 X^{3} Y^{3} Z

Algorithm definition

The algorithm ⟨12×18×27:3320⟩ is the (Kronecker) tensor product of ⟨3×6×3:40⟩ with ⟨4×3×9:83⟩.

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