Description of fast matrix multiplication algorithm: ⟨6×7×24:672⟩

Algorithm type

26 X^{4} Y^{4} Z^{4} + 8 X^{3} Y^{4} Z^{4} + 2 X^{3} Y^{3} Z^{4} + 32 X^{2} Y^{4} Z^{2} + 96 X^{2} Y^{3} Z^{3} + 32 X^{2} Y^{2} Z^{4} + 4 X Y^{4} Z^{2} + 144 X Y^{3} Z^{3} + 4 X Y^{2} Z^{4} + 108 X^{2} Y^{2} Z^{2} + 108 X Y^{2} Z + 108 X Y Z^{2}

Algorithm definition

The algorithm ⟨6×7×24:672⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨6×7×12:336⟩.

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