Description of fast matrix multiplication algorithm: ⟨4×6×28:490⟩

Algorithm type

14X4Y4Z4+8X2Y6Z2+12X2Y4Z2+120X2Y2Z2+48XY3Z+72XY2Z+216XYZ14X4Y4Z48X2Y6Z212X2Y4Z2120X2Y2Z248XY3Z72XY2Z216XYZ14*X^4*Y^4*Z^4+8*X^2*Y^6*Z^2+12*X^2*Y^4*Z^2+120*X^2*Y^2*Z^2+48*X*Y^3*Z+72*X*Y^2*Z+216*X*Y*Z

Algorithm definition

The algorithm ⟨4×6×28:490⟩ is the (Kronecker) tensor product of ⟨2×2×4:14⟩ with ⟨2×3×7:35⟩.

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