Unique low rank completability of partially filled matrices
From MaRDI portal
Publication:326825
DOI10.1016/j.jctb.2016.07.013zbMath1354.15018OpenAlexW2522187884MaRDI QIDQ326825
Tibor Jordán, Bill Jackson, Shin-ichi Tanigawa
Publication date: 12 October 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2016.07.013
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48) Matrix completion problems (15A83)
Related Items (3)
Completion of tree metrics and rank 2 matrices ⋮ Global rigidity of periodic graphs under fixed-lattice representations ⋮ Sufficient conditions for the global rigidity of periodic graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global rigidity: The effect of coning
- Connected rigidity matroids and unique realizations of graphs
- Sufficient conditions for the global rigidity of graphs
- Generic global rigidity
- Globally linked pairs of vertices in equivalent realizations of graphs
- Bipartite rigidity
- Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint
- Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
- Reconstructing a three-dimensional model with arbitrary errors
- Characterizing generic global rigidity
- Conditions for Unique Graph Realizations
- The Rigidity of Graphs
- On the rank minimization problem over a positive semidefinite linear matrix inequality
- Combinatorial Conditions for the Unique Completability of Low-Rank Matrices
- Rank-one completions of partial matrices and completely rank-nonincreasing linear functionals
- Euclidean Distance Geometry and Applications
- The Algebraic Combinatorial Approach for Low-Rank Matrix Completion
- On the structure of linear graphs
This page was built for publication: Unique low rank completability of partially filled matrices
