Description of fast matrix multiplication algorithm: ⟨4×16×30:1248⟩

Algorithm type

8 X^{4} Y^{16} Z^{4} + 32 X^{4} Y^{12} Z^{4} + 40 X^{2} Y^{16} Z^{2} + 32 X Y^{16} Z + 32 X^{4} Y^{8} Z^{4} + 96 X^{2} Y^{12} Z^{2} + 64 X Y^{12} Z + 80 X^{2} Y^{8} Z^{2} + 48 X Y^{8} Z + 112 X^{2} Y^{4} Z^{2} + 64 X^{2} Y^{3} Z^{2} + 64 X^{2} Y^{2} Z^{2} + 160 X Y^{4} Z + 128 X Y^{3} Z + 96 X Y^{2} Z + 192 X Y Z

Algorithm definition

The algorithm ⟨4×16×30:1248⟩ is the (Kronecker) tensor product of ⟨2×4×5:32⟩ with ⟨2×4×6:39⟩.

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