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

Algorithm type

32 X^{6} Y^{6} Z^{6} + 224 X^{4} Y^{6} Z^{6} + 48 X^{3} Y^{6} Z^{6} + 336 X^{2} Y^{6} Z^{6} + 224 X^{2} Y^{6} Z^{3} + 96 X^{4} Y^{3} Z^{3} + 336 X Y^{6} Z^{3} + 464 X^{2} Y^{3} Z^{3} + 480 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨12×18×18:2240⟩ is the (Kronecker) tensor product of ⟨3×3×6:40⟩ with ⟨4×6×3:56⟩.

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