Description of fast matrix multiplication algorithm: ⟨10×10×28:1760⟩

Algorithm type

16 X^{4} Y^{8} Z^{10} + 16 X^{4} Y^{8} Z^{8} + 8 X^{4} Y^{8} Z^{6} + 80 X^{4} Y^{8} Z^{4} + 48 X^{2} Y^{4} Z^{10} + 16 X^{2} Y^{8} Z^{5} + 8 X^{4} Y^{8} Z^{2} + 16 X^{2} Y^{8} Z^{4} + 56 X^{2} Y^{4} Z^{8} + 8 X^{2} Y^{8} Z^{3} + 96 X^{2} Y^{8} Z^{2} + 32 X^{2} Y^{4} Z^{6} + 8 X^{2} Y^{8} Z + 48 X^{2} Y^{4} Z^{4} + 16 X Y^{8} Z + 48 X Y^{4} Z^{5} + 32 X^{2} Y^{2} Z^{5} + 56 X Y^{4} Z^{4} + 112 X^{2} Y^{4} Z^{2} + 32 X^{2} Y^{2} Z^{4} + 32 X Y^{4} Z^{3} + 16 X^{2} Y^{2} Z^{3} + 48 X Y^{4} Z^{2} + 96 X Y Z^{5} + 160 X^{2} Y^{2} Z^{2} + 112 X Y^{4} Z + 112 X Y Z^{4} + 16 X^{2} Y^{2} Z + 64 X Y Z^{3} + 32 X Y^{2} Z + 96 X Y Z^{2} + 224 X Y Z

Algorithm definition

The algorithm ⟨10×10×28:1760⟩ is the (Kronecker) tensor product of ⟨2×5×4:32⟩ with ⟨5×2×7:55⟩.

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