Description of fast matrix multiplication algorithm: ⟨12×21×24:3400⟩

Algorithm type

432 X^{4} Y^{6} Z^{6} + 648 X^{2} Y^{6} Z^{6} + 176 X^{2} Y^{6} Z^{3} + 80 X^{2} Y^{3} Z^{6} + 176 X^{4} Y^{3} Z^{3} + 264 X Y^{6} Z^{3} + 120 X Y^{3} Z^{6} + 760 X^{2} Y^{3} Z^{3} + 744 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨12×21×24:3400⟩ is the (Kronecker) tensor product of ⟨3×3×6:40⟩ with ⟨4×7×4:85⟩.

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