On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication
From MaRDI portal
Publication:4976181
DOI10.1080/10586458.2016.1162230zbMath1409.68333OpenAlexW2964247956MaRDI QIDQ4976181
Nicholas Ryder, Joseph 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
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Multilinear algebra, tensor calculus (15A69)
Related Items
Tensor decomposition and homotopy continuation ⋮ On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry
Cites Work
- Unnamed Item
- On the third secant variety
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
- A note on border rank
- Rank and optimal computation of generic tensors
- A lower bound for the border rank of a bilinear map
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
- Gaussian elimination is not optimal
- On multiplication of 2 \(\times\) 2 matrices
- The bilinear complexity and practical algorithms for matrix multiplication
- New lower bounds for the border rank of matrix multiplication
- The border rank of the multiplication of $2\times 2$ matrices is seven
- Partial and Total Matrix Multiplication
- Equations for Lower Bounds on Border Rank
