Description of fast matrix multiplication algorithm: ⟨8×12×12:735⟩

Algorithm type

3X8Y8Z8+6X4Y8Z4+42X4Y4Z4+72X2Y4Z2+180X2Y2Z2+216XY2Z+216XYZ3X8Y8Z86X4Y8Z442X4Y4Z472X2Y4Z2180X2Y2Z2216XY2Z216XYZ3*X^8*Y^8*Z^8+6*X^4*Y^8*Z^4+42*X^4*Y^4*Z^4+72*X^2*Y^4*Z^2+180*X^2*Y^2*Z^2+216*X*Y^2*Z+216*X*Y*Z

Algorithm definition

The algorithm ⟨8×12×12:735⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨4×6×6:105⟩.

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