On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication
- Additional Document Info
- View All
© 2017 Taylor & Francis. We make an in-depth study of the known border rank (i.e., approximate) algorithms for the matrix multiplication tensor M〈n,2,2〉 ϵ C2nÄC4ÄC2n encoding the multiplication of an n × 2 matrix by a 2 × 2 matrix.
author list (cited authors)
Landsberg, J. M., & Ryder, N.