An inertia formula for Hermitian matrices with sparse inverses (Q1183205): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Determinantal formulae for matrices with sparse inverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinantal formulae for matrix completions associated with chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Desirability of Acyclic Database Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On negative eigenvalues of selfadjoint eztensions of band matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completing a matrix when certain entries of its inverse are specified / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / 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: Determination of the inertia of a partitioned Hermitian matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning-tree extensions of the Hadamard-Fischer inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices with chordal inverse zero-patterns / 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: Triangulated graphs and the elimination process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the foundations of combinatorial theory I. Theory of M�bius Functions / rank
 
Normal rank

Latest revision as of 14:42, 15 May 2024

scientific article
Language Label Description Also known as
English
An inertia formula for Hermitian matrices with sparse inverses
scientific article

    Statements

    An inertia formula for Hermitian matrices with sparse inverses (English)
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    Let \(A\) denote a nonsingular complex Hermitian matrix and let \(G=(G,E)\) denote an undirected chordal graph on the vertices \(\{1,\ldots,n\}\), i.e. for each sequence \(v_ 1,\ldots,v_ k,v_ 1\) such that \(v_ kv_ 1\in E\), \(v_ iv_{i+1}\in E\) and \(k>3\), there are two nonconsecutive vertices \(v_ i\) and \(v_ j\) such that \(v_ iv_ j\in E\). In case that the graph \(G(A^{-1})\) of \(A^{-1}\) satisfies \(G(A^{-1})\subset G\), the authors give a formula for the inertia of \(A\) in terms of inertias of certain principal submatrices of \(A\). In the course of proof, the authors establish a relationship between the inertia of the principal submatrix of \(A\) and that of the complementary block of \(A^{-1}\) which is of independent interest.
    0 references
    sparse inverses
    0 references
    complex Hermitian matrix
    0 references
    undirected chordal graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references