Description of fast matrix multiplication algorithm: ⟨21×21×24:5760⟩

Algorithm type

16 X^{10} Y^{6} Z^{3} + 128 X^{6} Y^{6} Z^{6} + 32 X^{8} Y^{6} Z^{3} + 704 X^{4} Y^{6} Z^{6} + 16 X^{6} Y^{6} Z^{3} + 16 X^{6} Y^{3} Z^{6} + 192 X^{3} Y^{6} Z^{6} + 16 X^{8} Y^{3} Z^{3} + 24 X^{5} Y^{6} Z^{3} + 1072 X^{2} Y^{6} Z^{6} + 16 X^{2} Y^{3} Z^{9} + 64 X^{4} Y^{6} Z^{3} + 16 X^{4} Y^{3} Z^{6} + 24 X Y^{6} Z^{6} + 24 X Y^{3} Z^{9} + 96 X^{6} Y^{3} Z^{3} + 24 X^{3} Y^{6} Z^{3} + 24 X^{3} Y^{3} Z^{6} + 216 X^{2} Y^{6} Z^{3} + 232 X^{2} Y^{3} Z^{6} + 360 X^{4} Y^{3} Z^{3} + 288 X Y^{6} Z^{3} + 312 X Y^{3} Z^{6} + 144 X^{3} Y^{3} Z^{3} + 984 X^{2} Y^{3} Z^{3} + 720 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨21×21×24:5760⟩ is the (Kronecker) tensor product of ⟨3×3×6:40⟩ with ⟨7×7×4:144⟩.

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