Description of fast matrix multiplication algorithm: ⟨3×4×12:112⟩

Algorithm type

4X2Y3Z2+28X2Y2Z2+12XY2Z+28XYZ2+40XYZ4X2Y3Z228X2Y2Z212XY2Z28XYZ240XYZ4*X^2*Y^3*Z^2+28*X^2*Y^2*Z^2+12*X*Y^2*Z+28*X*Y*Z^2+40*X*Y*Z

Algorithm definition

The algorithm ⟨3×4×12:112⟩ is the (Kronecker) tensor product of ⟨3×4×6:56⟩ with ⟨1×1×2:2⟩.

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