| || || || || || || |
Memoirs of the American Mathematical Society
1996; 69 pp; softcover
List Price: US$38
Individual Members: US$22.80
Institutional Members: US$30.40
Order Code: MEMO/122/584
Given a partial symmetric matrix, the positive definite completion problem asks if the unspecified entries in the matrix can be chosen so as to make the resulting matrix positive definite. Applications include probability and statistics, image enhancement, systems engineering, geophysics, and mathematical programming. The positive definite completion problem can also be viewed as a mechanism for addressing a fundamental problem in Euclidean geometry: which potential geometric configurations of vectors (i.e., configurations with angles between some vectors specified) are realizable in a Euclidean space. The positions of the specified entries in a partial matrix are naturally described by a graph. The question of existence of a positive definite completion was previously solved completely for the restrictive class of chordal graphs and this work solves the problem for the class of cycle completable graphs, a significant generalization of chordal graphs. These are the graphs for which knowledge of completability for induced cycles (and cliques) implies completability of partial symmetric matrices with the given graph.
Graduate students and research mathematicians interested in graphs and matrices.
Table of Contents
AMS Home |
© Copyright 2013, American Mathematical Society