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

Algorithm type

18⁢X4⁢Y4⁢Z4+18⁢X2⁢Y4⁢Z2+18⁢X2⁢Y2⁢Z4+108⁢X2⁢Y2⁢Z2+108⁢X⁢Y2⁢Z+108⁢X⁢Y⁢Z218X4Y4Z418X2Y4Z218X2Y2Z4108X2Y2Z2108XY2Z108XYZ218*X^4*Y^4*Z^4+18*X^2*Y^4*Z^2+18*X^2*Y^2*Z^4+108*X^2*Y^2*Z^2+108*X*Y^2*Z+108*X*Y*Z^2

Algorithm definition

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

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