Description of fast matrix multiplication algorithm: ⟨6×8×24:756⟩

Algorithm type

36⁢X4⁢Y4⁢Z4+36⁢X2⁢Y4⁢Z2+36⁢X2⁢Y2⁢Z4+216⁢X2⁢Y2⁢Z2+216⁢X⁢Y2⁢Z+216⁢X⁢Y⁢Z236X4Y4Z436X2Y4Z236X2Y2Z4216X2Y2Z2216XY2Z216XYZ236*X^4*Y^4*Z^4+36*X^2*Y^4*Z^2+36*X^2*Y^2*Z^4+216*X^2*Y^2*Z^2+216*X*Y^2*Z+216*X*Y*Z^2

Algorithm definition

The algorithm ⟨6×8×24:756⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨6×8×12:378⟩.

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