Determinantal formulae for matrix completions associated with chordal graphs (Q1823289): Difference between revisions

For a given partial Hermitian positive definite matrix A and its undirected graph G(A), an explicit determinantal formula for the unique determinant maximizing positive definite completion of A is given and a characterization of the formula via graph theoretical methods is discussed. A simplification of the general methods to compute this completion is given.