Unique low rank completability of partially filled matrices (Q326825): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Rigidity of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing a three-dimensional model with arbitrary errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic global rigidity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global rigidity: The effect of coning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4076414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing generic global rigidity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-one completions of partial matrices and completely rank-nonincreasing linear functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for Unique Graph Realizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected rigidity matroids and unique realizations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally linked pairs of vertices in equivalent realizations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Conditions for the Unique Completability of Low-Rank Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite rigidity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algebraic Combinatorial Approach for Low-Rank Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Distance Geometry and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rank minimization problem over a positive semidefinite linear matrix inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness of Low-Rank Matrix Completion by Rigidity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for the global rigidity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3334528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717849 / rank
 
Normal rank

Revision as of 17:00, 12 July 2024

scientific article
Language Label Description Also known as
English
Unique low rank completability of partially filled matrices
scientific article

    Statements

    Unique low rank completability of partially filled matrices (English)
    0 references
    0 references
    0 references
    0 references
    12 October 2016
    0 references
    unique low rank matrix completion
    0 references
    positive semidefinite matrices
    0 references
    rigidity of frameworks
    0 references

    Identifiers