Description of fast matrix multiplication algorithm: ⟨4×5×12:180⟩

Algorithm type

60X2Y2Z2+2X3YZ+4X2Y2Z+4X2YZ2+2XY3Z+2XY2Z2+14X2YZ+32XY2Z+28XYZ2+32XYZ60X2Y2Z22X3YZ4X2Y2Z4X2YZ22XY3Z2XY2Z214X2YZ32XY2Z28XYZ232XYZ60*X^2*Y^2*Z^2+2*X^3*Y*Z+4*X^2*Y^2*Z+4*X^2*Y*Z^2+2*X*Y^3*Z+2*X*Y^2*Z^2+14*X^2*Y*Z+32*X*Y^2*Z+28*X*Y*Z^2+32*X*Y*Z

Algorithm definition

The algorithm ⟨4×5×12:180⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨4×5×6:90⟩.

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