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

DOI10.1080/10586458.2016.1162230zbMATH Open1409.68333OpenAlexW2964247956MaRDI QIDQ4976181FDOQ4976181

J. M. Landsberg, Nicholas Ryder

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)

Cites Work

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

Cited In (3)

• The border support rank of two-by-two matrix multiplication is seven
• Tensor decomposition and homotopy continuation
• On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry

Recommendations

• Geometry and the complexity of matrix multiplication 👍 👎
• New lower bounds for the border rank of matrix multiplication 👍 👎
• 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 Geometry of Rank Decompositions of Matrix Multiplication I: 2 × 2 Matrices 👍 👎
• A $2{\mathbf{n}}^2-{\text{log}}_2({\mathbf{n}})-1$ lower bound for the border rank of matrix multiplication 👍 👎
• Geometric conditions for strict submultiplicativity of rank and border rank 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)