Positive semidefinite matrices with a given sparsity pattern (Q1109100): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Subalgebras of \(C^ *\)-algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverses of banded matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Norm-Preserving Dilations and Their Applications to Optimal Error Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of band matrices with band inverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invertible Selfadjoint Extensions of Band Matrices and Their Entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive definite completions of partial Hermitian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inertia possibilities for completions of partial hermitian matrices<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completion of partial matrices to contractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schur products and matrix completions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Spectral Permanence for Certain Banach Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulated graphs and the elimination process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive Functions on C ∗ -Algebras / rank
 
Normal rank

Latest revision as of 19:04, 18 June 2024

scientific article
Language Label Description Also known as
English
Positive semidefinite matrices with a given sparsity pattern
scientific article

    Statements

    Positive semidefinite matrices with a given sparsity pattern (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1988
    0 references
    Given a sparsity pattern, the cone of positive matrices which have zero in prescribed entries is considered. The highest rank of the extremal matrices in the cone is called the order of pattern. The order is linked with graph properties of the pattern. It leads to a classification of certain subgraphs of the pattern.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithmic graph theory
    0 references
    completion problems
    0 references
    sparsity pattern
    0 references
    cone of positive matrices
    0 references
    extremal matrices
    0 references
    order of pattern
    0 references
    0 references