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

Algorithm type

256X4Y6Z6+384X2Y6Z6+512X2Y3Z3+768XY3Z3256X4Y6Z6384X2Y6Z6512X2Y3Z3768XY3Z3256*X^4*Y^6*Z^6+384*X^2*Y^6*Z^6+512*X^2*Y^3*Z^3+768*X*Y^3*Z^3

Algorithm definition

The algorithm ⟨12×12×24:1920⟩ is the (Kronecker) tensor product of ⟨3×3×6:40⟩ with ⟨4×4×4:48⟩.

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