Description of fast matrix multiplication algorithm: ⟨18×21×21:4480⟩

Algorithm type

256 X^{9} Y^{6} Z^{6} + 384 X^{9} Y^{6} Z^{3} + 384 X^{9} Y^{3} Z^{6} + 96 X^{6} Y^{6} Z^{6} + 240 X^{6} Y^{4} Z^{6} + 576 X^{9} Y^{3} Z^{3} + 144 X^{6} Y^{3} Z^{6} + 456 X^{6} Y^{2} Z^{6} + 32 X^{3} Y^{8} Z^{3} + 144 X^{6} Y Z^{6} + 192 X^{3} Y^{6} Z^{3} + 240 X^{3} Y^{4} Z^{3} + 288 X^{3} Y^{3} Z^{3} + 592 X^{3} Y^{2} Z^{3} + 456 X^{3} Y Z^{3}

Algorithm definition

The algorithm ⟨18×21×21:4480⟩ is the (Kronecker) tensor product of ⟨3×7×7:112⟩ with ⟨6×3×3:40⟩.

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