On the geometry of border rank algorithms for n x 2 by 2 x 2 matrix multiplication

2015/09/28 by J. M. Landsberg, Landsberg, J. M., Nicholas Ryder +1 · 1 citation
Computer Science · Mathematics · #15A99 #68Q17 #68Q25 #Algebraic Geometry (math.AG) #FOS: Mathematics #Matrix Theory and Algorithms #Numerical Analysis (math.NA) #Parallel Computing and Optimization Techniques #Tensor decomposition and applications

paper · pdf · doi:10.48550/arxiv.1509.08323

openalex publication_date 2015/09/28 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

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.

Cited by

• On the geometry of border rank algorithms for matrix multiplication and other tensors with symmetry

Related

• On the geometry of border rank algorithms for matrix multiplication and other tensors with symmetry
• New lower bounds for the border rank of matrix multiplication
• A 2n²-log(n)-1 lower bound for the border rank of matrix multiplication
• Inner Rank and Lower Bounds for Matrix Multiplication
• Explicit Lower Bounds via Geometric Complexity Theory