On the Geometry of Border Rank Algorithms for n x 2 by 2 x 2 Matrix Multiplication Academic Article

abstract

• 2017 Taylor & Francis. We make an in-depth study of the known border rank (i.e., approximate) algorithms for the matrix multiplication tensor Mn,2,2 C2nC4C2n encoding the multiplication of an n 2 matrix by a 2 2 matrix.

authors

• Landsberg, Joseph

published proceedings

• EXPERIMENTAL MATHEMATICS

author list (cited authors)

• Landsberg, J. M., & Ryder, N.

citation count

• 3

complete list of authors

• Landsberg, JM||Ryder, Nicholas

publication date

• July 2017

publisher

• Taylor & Francis  Publisher

published in

• Experimental Mathematics  Journal

keywords

• Approximate Algorithms
• Border Rank
• Matrix Multiplication
• Segre Variety

Digital Object Identifier (DOI)

• 10.1080/10586458.2016.1162230

start page

• 275

end page

• 286

volume

• 26

issue

• 3

URL

• http://dx.doi.org/10.1080/10586458.2016.1162230