The geometry of rank decompositions of matrix multiplication II: 3×3 matrices

This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix multiplication decompositions, give a geometric proof of the theorem of Burichenko's theorem establishing the symmetry group of Strassen's algorithm, and present two particularly nice subfamilies in the Strassen family of decompositions.

[1]  Joshua A. Grochow,et al.  Matrix multiplication algorithms from group orbits , 2016, ArXiv.

[2]  J. M. Landsberg,et al.  Determinantal equations for secant varieties and the Eisenbud–Koh–Stillman conjecture , 2010, J. Lond. Math. Soc..

[3]  Hans F. de Groote.  On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings I. The Isotropy Group of a Bilinear Mapping , 1978, Theor. Comput. Sci..

[4]  Yaroslav Shitov,et al.  A Counterexample to Comon's Conjecture , 2017, SIAM J. Appl. Algebra Geom..

[5]  A. Smirnov,et al.  The bilinear complexity and practical algorithms for matrix multiplication , 2013 .

[6]  Hwangrae Lee,et al.  Power Sum Decompositions of Elementary Symmetric Polynomials , 2015, 1508.05235.

[7]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[8]  Shmuel Friedland,et al.  Remarks on the Symmetric Rank of Symmetric Tensors , 2015, SIAM J. Matrix Anal. Appl..

[9]  Tamara G. Kolda,et al.  Tensor Decompositions and Applications , 2009, SIAM Rev..

[10]  Vladimir P. Burichenko,et al.  Symmetries of matrix multiplication algorithms. I , 2015, ArXiv.

[11]  S. Garibaldi,et al.  Linear preservers and representations with a 1-dimensional ring of invariants , 2012, 1204.2840.

[12]  Alexandre Sedoglavic,et al.  Laderman matrix multiplication algorithm can be constructed using Strassen algorithm and related tensor's isotropies , 2017, ArXiv.

[13]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[14]  Pierre Comon,et al.  Tensor Decompositions, State of the Art and Applications , 2002 .

[15]  Austin R. Benson,et al.  A framework for practical parallel fast matrix multiplication , 2014, PPoPP.

[16]  Vladimir P. Burichenko.  On symmetries of the Strassen algorithm , 2014, ArXiv.

[17]  Hans F. de Groote.  On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings. II. Optimal Algorithms for 2x2-Matrix Multiplication , 1978, Theor. Comput. Sci..

[18]  J. Landsberg.  Tensors: Geometry and Applications , 2011 .

[19]  Fulvio Gesmundo,et al.  Geometric aspects of Iterated Matrix Multiplication , 2015, 1512.00766.

[20]  Rodney W. Johnson,et al.  Noncommutative Bilinear Algorithms for 3 x 3 Matrix Multiplication , 1986, SIAM J. Comput..