Description of fast matrix multiplication algorithm: ⟨2×4×32:204⟩

Algorithm type

4X2Y4Z2+48X2Y2Z2+16XY4Z+32XY3Z+104XYZ4X2Y4Z248X2Y2Z216XY4Z32XY3Z104XYZ4*X^2*Y^4*Z^2+48*X^2*Y^2*Z^2+16*X*Y^4*Z+32*X*Y^3*Z+104*X*Y*Z

Algorithm definition

The algorithm ⟨2×4×32:204⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨2×4×16:102⟩.

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