Description of fast matrix multiplication algorithm: ⟨4×21×32:1760⟩

Algorithm type

8 X Y^{21} Z + 16 X Y^{18} Z + 8 X^{2} Y^{14} Z^{2} + 8 X Y^{15} Z + 16 X^{2} Y^{12} Z^{2} + 32 X^{4} Y^{6} Z^{4} + 8 X^{2} Y^{10} Z^{2} + 8 X Y^{12} Z + 32 X^{2} Y^{9} Z^{2} + 64 X^{4} Y^{4} Z^{4} + 8 X^{2} Y^{8} Z^{2} + 40 X Y^{9} Z + 104 X^{2} Y^{6} Z^{2} + 24 X Y^{7} Z + 40 X^{2} Y^{4} Z^{2} + 88 X Y^{6} Z + 96 X^{2} Y^{3} Z^{2} + 24 X Y^{5} Z + 328 X^{2} Y^{2} Z^{2} + 24 X Y^{4} Z + 256 X Y^{3} Z + 120 X Y^{2} Z + 408 X Y Z

Algorithm definition

The algorithm ⟨4×21×32:1760⟩ is the (Kronecker) tensor product of ⟨2×3×4:20⟩ with ⟨2×7×8:88⟩.

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