Description of fast matrix multiplication algorithm: ⟨16×24×24:5145⟩

Algorithm type

3X16Y16Z16+6X8Y16Z8+60X8Y8Z8+108X4Y8Z4+432X4Y4Z4+648X2Y4Z2+1296X2Y2Z2+1296XY2Z+1296XYZ3X16Y16Z166X8Y16Z860X8Y8Z8108X4Y8Z4432X4Y4Z4648X2Y4Z21296X2Y2Z21296XY2Z1296XYZ3*X^16*Y^16*Z^16+6*X^8*Y^16*Z^8+60*X^8*Y^8*Z^8+108*X^4*Y^8*Z^4+432*X^4*Y^4*Z^4+648*X^2*Y^4*Z^2+1296*X^2*Y^2*Z^2+1296*X*Y^2*Z+1296*X*Y*Z

Algorithm definition

The algorithm ⟨16×24×24:5145⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨8×12×12:735⟩.

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