Determinantal formulae for matrix completions associated with chordal graphs
From MaRDI portal
Publication:1823289
DOI10.1016/0024-3795(89)90706-4zbMath0681.15003OpenAlexW1972289147WikidataQ115802521 ScholiaQ115802521MaRDI QIDQ1823289
Wayne W. Barrett, Charles R. Johnson, Michael Lundquist
Publication date: 1989
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(89)90706-4
undirected graphdeterminant maximizing positive definite completionpartial Hermitian positive definite matrix
Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Invertible completions of partial operator matrices: The nonsymmetric case ⋮ Completing a block diagonal matrix with a partially prescribed inverse ⋮ Matrices with chordal inverse zero-patterns ⋮ Completion problem with partial correlation vines ⋮ On Gaussian elimination and determinant formulas for matrices with chordal inverses ⋮ Maximum entropy models for general lag patterns ⋮ Multigraph representations of hierarchical loglinear models ⋮ Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones ⋮ On the Hadamard-Fischer inequality, the inclusion-exclusion formula, and bipartite graphs ⋮ Determinantal formulae and nonsymmetric gaussian perfect elimination ⋮ Unnamed Item ⋮ The elliptic matrix completion problem ⋮ Subgraph trees in graph theory ⋮ An efficient algorithm for maximum entropy extension of block-circulant covariance matrices ⋮ Inheritance principles for chordal graphs ⋮ High, low, and quantitative roads in linear algebra ⋮ An inertia formula for Hermitian matrices with sparse inverses ⋮ The positive definite completion problem revisited ⋮ Determinantal inequalities for positive definite matrices ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ The inverse of any two-by-two nonsingular partitioned matrix and three matrix inverse completion problems ⋮ Deterministic inverse zero-patterns ⋮ The cyclic rank completion problem with general blocks ⋮ Rank inequalities for positive semidefinite matrices ⋮ Positive definite completions and determinant maximization ⋮ Algebraic characterizations of chordality ⋮ Local inversion of matrices with sparse inverses ⋮ Matrix sandwich problems
Cites Work
- Unnamed Item
- Unnamed Item
- Positive definite completions of partial Hermitian matrices
- Determinantal formulae for matrices with sparse inverses
- Determinantal formulae for matrices with sparse inverses. II: Asymmetric zero patterns
- Spanning-tree extensions of the Hadamard-Fischer inequalities
- Inherited Matrix Entries: Principal Submatrices of the Inverse
- Matrix Analysis
