Description of fast matrix multiplication algorithm: ⟨4×6×24:420⟩

Algorithm type

12X4Y4Z4+24X2Y4Z2+96X2Y2Z2+144XY2Z+144XYZ12X4Y4Z424X2Y4Z296X2Y2Z2144XY2Z144XYZ12*X^4*Y^4*Z^4+24*X^2*Y^4*Z^2+96*X^2*Y^2*Z^2+144*X*Y^2*Z+144*X*Y*Z

Algorithm definition

The algorithm ⟨4×6×24:420⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨4×6×12:210⟩.

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