On the geometry of border rank algorithms for n x 2 by 2 x 2 matrix multiplication
arXiv:1509.08323
Abstract
We make an in-depth study of the known border rank (i.e. approximate) algorithms for the matrix multiplication tensor encoding the multiplication of an n x 2 matrix by a 2 x 2 matrix.
19 pages, two figures