Description of fast matrix multiplication algorithm: ⟨9×30×32:4860⟩

Algorithm type

18 X^{6} Y^{2} Z^{6} + 54 X^{4} Y^{6} Z^{4} + 486 X^{4} Y^{4} Z^{4} + 18 X^{2} Y^{4} Z^{6} + 18 X^{6} Y^{2} Z^{2} + 18 X^{6} Y Z^{3} + 144 X^{2} Y^{6} Z^{2} + 126 X^{2} Y^{4} Z^{4} + 180 X^{2} Y^{2} Z^{6} + 54 X^{4} Y^{3} Z^{2} + 18 X^{6} Y Z + 504 X^{4} Y^{2} Z^{2} + 18 X^{3} Y^{2} Z^{3} + 774 X^{2} Y^{4} Z^{2} + 252 X^{2} Y^{2} Z^{4} + 90 X Y^{6} Z + 18 X Y^{4} Z^{3} + 18 X^{2} Y^{2} Z^{3} + 126 X Y^{4} Z^{2} + 18 X^{4} Y Z + 18 X^{3} Y^{2} Z + 90 X^{2} Y^{3} Z + 198 X^{2} Y^{2} Z^{2} + 180 X^{2} Y Z^{3} + 288 X Y^{4} Z + 180 X Y^{2} Z^{3} + 306 X^{2} Y^{2} Z + 252 X^{2} Y Z^{2} + 252 X Y^{2} Z^{2} + 72 X^{2} Y Z + 72 X Y^{2} Z

Algorithm definition

The algorithm ⟨9×30×32:4860⟩ is the (Kronecker) tensor product of ⟨3×5×8:90⟩ with ⟨3×6×4:54⟩.

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