Multiple typical ranks in matrix completion

DOI10.1016/J.LAA.2025.01.026MaRDI QIDQ7018419zbMATH OpenFDO

Authors Mareike Dressler, Robert Krone

Publication date 5 March 2025

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.LAA.2025.01.026

zbMATH Keywords

circulant graphgeneric rankmatrix completiontypical rank

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Real algebraic sets (14P05) Vector spaces, linear dependence, rank, lineability (15A03) Matrix completion problems (15A83)

Cites work

• Exact matrix completion via convex optimization
• On maximum, typical and generic ranks
• On real typical ranks
• On the rank minimization problem over a positive semidefinite linear matrix inequality
• Tensors: Asymptotic Geometry and Developments 2016–2018
• The algebraic combinatorial approach for low-rank matrix completion
• The geometry of rank-one tensor completion
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Typical and generic ranks in matrix completion
• Zero forcing sets and bipartite circulants

This page was built for publication: Multiple typical ranks in matrix completion

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