On the geometry of border rank algorithms for n x 2 by 2 x 2 matrix multiplication
classification
💻 cs.NA
math.AG
keywords
matrixmultiplicationalgorithmsborderrankapproximateencodinggeometry
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.