Description of fast matrix multiplication algorithm: ⟨12×20×24:3264⟩

Algorithm type

32 X^{4} Y^{6} Z^{4} + 32 X^{6} Y^{2} Z^{4} + 288 X^{4} Y^{4} Z^{4} + 32 X^{4} Y^{2} Z^{6} + 32 X^{2} Y^{8} Z^{2} + 48 X^{2} Y^{4} Z^{6} + 96 X^{6} Y^{2} Z^{2} + 64 X^{4} Y^{4} Z^{2} + 80 X^{2} Y^{6} Z^{2} + 64 X^{2} Y^{2} Z^{6} + 128 X^{4} Y^{2} Z^{2} + 128 X^{2} Y^{4} Z^{2} + 64 X^{2} Y^{3} Z^{2} + 64 X^{3} Y Z^{2} + 640 X^{2} Y^{2} Z^{2} + 64 X^{2} Y Z^{3} + 64 X Y^{4} Z + 96 X Y^{2} Z^{3} + 192 X^{3} Y Z + 128 X^{2} Y^{2} Z + 160 X Y^{3} Z + 128 X Y Z^{3} + 256 X^{2} Y Z + 256 X Y^{2} Z + 128 X Y Z

Algorithm definition

The algorithm ⟨12×20×24:3264⟩ is the (Kronecker) tensor product of ⟨3×5×6:68⟩ with ⟨4×4×4:48⟩.

Algorithm description

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