Description of fast matrix multiplication algorithm: ⟨2×6×24:224⟩

Algorithm type

12 X^{2} Y^{4} Z^{2} + 4 X^{2} Y^{4} Z + 4 X Y^{5} Z + 52 X^{2} Y^{2} Z^{2} + 32 X Y^{4} Z + 36 X Y^{3} Z + 16 X Y^{2} Z + 68 X Y Z

Algorithm definition

The algorithm ⟨2×6×24:224⟩ is the (Kronecker) tensor product of ⟨1×1×4:4⟩ with ⟨2×6×6:56⟩.

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