Description of fast matrix multiplication algorithm: ⟨12×12×16:1392⟩

Algorithm type

112 X^{4} Y^{4} Z^{4} + 16 X^{6} Y^{2} Z^{2} + 32 X^{2} Y^{6} Z^{2} + 32 X^{2} Y^{4} Z^{4} + 32 X^{2} Y^{2} Z^{6} + 64 X^{2} Y^{4} Z^{2} + 64 X^{2} Y^{2} Z^{4} + 336 X^{2} Y^{2} Z^{2} + 32 X^{3} Y Z + 64 X Y^{3} Z + 64 X Y^{2} Z^{2} + 64 X Y Z^{3} + 128 X Y^{2} Z + 128 X Y Z^{2} + 224 X Y Z

Algorithm definition

The algorithm ⟨12×12×16:1392⟩ is the (Kronecker) tensor product of ⟨3×3×4:29⟩ with ⟨4×4×4:48⟩.

Algorithm description

maple tensor representation (compressed by bzip2);
maple LRP representation (compressed by bzip2);
maple evaluation scheme (compressed by bzip2).

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