On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication

DOI10.1080/10586458.2016.1162230MaRDI QIDQ4976181zbMATH OpenOpenAlexFDO

Authors Nicholas Ryder, J. M. Landsberg

Publication date 27 July 2017

Published in Experimental Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10586458.2016.1162230

zbMATH Keywords

approximation algorithmsSegre varietymatrix multiplicationborder rank

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• On the geometry of border rank decompositions for matrix multiplication and other tensors with symmetry
• A \(2\mathbf{n}^2-\log_2(\mathbf{n})-1\) lower bound for the border rank of matrix multiplication
• New lower bounds for the border rank of matrix multiplication
• The Geometry of Rank Decompositions of Matrix Multiplication I: 2 × 2 Matrices
• Geometric conditions for strict submultiplicativity of rank and border rank
• The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices
• On bilinear complexity of multiplication of \(m\times 2\) and \(2\times 2\) matrices
• Geometry and the complexity of matrix multiplication
• scientific article; zbMATH DE number 4137244
• scientific article; zbMATH DE number 1051702

Cites work

• scientific article; zbMATH DE number 5968745 (Why is no real title available?)
• A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
• A lower bound for the border rank of a bilinear map
• A note on border rank
• Equations for lower bounds on border rank
• Gaussian elimination is not optimal
• New lower bounds for the border rank of matrix multiplication
• On multiplication of 2 2 matrices
• On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
• On the third secant variety
• Partial and Total Matrix Multiplication
• Rank and optimal computation of generic tensors
• The bilinear complexity and practical algorithms for matrix multiplication
• The border rank of the multiplication of $2\times 2$ matrices is seven
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication

Cited in

(9)

• A note on border rank
• The border support rank of two-by-two matrix multiplication is seven
• On the geometry of border rank decompositions for matrix multiplication and other tensors with symmetry
• The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices
• The border rank of the multiplication of $2\times 2$ matrices is seven
• On degeneration of tensors and algebras
• Tensor decomposition and homotopy continuation
• The tensor Rank of \(5 \times 5\) matrices multiplication is bounded by 98 andits border Rank by 89
• New lower bounds for matrix multiplication and

This page was built for publication: On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976181)