Description of fast matrix multiplication algorithm: ⟨12×24×30:4800⟩

Algorithm type

64X9Y12Z6+96X9Y12Z3+64X3Y12Z2+512X6Y6Z4+96X3Y12Z+768X6Y6Z2+1280X3Y3Z2+1920X3Y3Z64X9Y12Z696X9Y12Z364X3Y12Z2512X6Y6Z496X3Y12Z768X6Y6Z21280X3Y3Z21920X3Y3Z64*X^9*Y^12*Z^6+96*X^9*Y^12*Z^3+64*X^3*Y^12*Z^2+512*X^6*Y^6*Z^4+96*X^3*Y^12*Z+768*X^6*Y^6*Z^2+1280*X^3*Y^3*Z^2+1920*X^3*Y^3*Z

Algorithm definition

The algorithm ⟨12×24×30:4800⟩ is the (Kronecker) tensor product of ⟨3×6×3:40⟩ with ⟨4×4×10:120⟩.

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