Description of fast matrix multiplication algorithm: ⟨6×16×24:1456⟩

Algorithm type

12 X^{4} Y^{6} Z^{4} + 4 X^{2} Y^{9} Z^{2} + 84 X^{4} Y^{4} Z^{4} + 44 X^{2} Y^{6} Z^{2} + 148 X^{2} Y^{4} Z^{2} + 84 X^{2} Y^{2} Z^{4} + 12 X Y^{6} Z + 20 X^{2} Y^{3} Z^{2} + 260 X^{2} Y^{2} Z^{2} + 48 X Y^{4} Z + 28 X Y^{3} Z^{2} + 40 X Y^{3} Z + 112 X Y^{2} Z^{2} + 220 X Y^{2} Z + 140 X Y Z^{2} + 200 X Y Z

Algorithm definition

The algorithm ⟨6×16×24:1456⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ with ⟨3×4×6: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