Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
The Real Positive Definite Completion Problem: Cycle Completability
 
Wayne W. Barrett Brigham Young University, Provo, UT
Charles R. Johnson College of William & Mary, Williamsburg, VA
Raphael Loewy Technion-Israel Institute of Technology, Haifa, Israel
The Real Positive Definite Completion Problem: Cycle Completability
eBook ISBN:  978-1-4704-0169-6
Product Code:  MEMO/122/584.E
List Price: $40.00
MAA Member Price: $36.00
AMS Member Price: $24.00
The Real Positive Definite Completion Problem: Cycle Completability
Click above image for expanded view
The Real Positive Definite Completion Problem: Cycle Completability
Wayne W. Barrett Brigham Young University, Provo, UT
Charles R. Johnson College of William & Mary, Williamsburg, VA
Raphael Loewy Technion-Israel Institute of Technology, Haifa, Israel
eBook ISBN:  978-1-4704-0169-6
Product Code:  MEMO/122/584.E
List Price: $40.00
MAA Member Price: $36.00
AMS Member Price: $24.00
  • Book Details
     
     
    Memoirs of the American Mathematical Society
    Volume: 1221996; 69 pp
    MSC: Primary 05; 15;

    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.

    Readership

    Graduate students and research mathematicians interested in graphs and matrices.

  • Table of Contents
     
     
    • Chapters
    • 1. Introduction
    • 2. Graph theory concepts
    • 3. Basic facts about the positive definite completion problem
    • 4. Examples
    • 5. Main result
    • 6. The implication $(1.0’) \Rightarrow (1.1)$
    • 7. The implication $(1.1) \Rightarrow (1.2)$
    • 8. The implication $(1.2) \Rightarrow (1.3)$
    • 9. The implication $(1.3) \Rightarrow (1.0)$
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Volume: 1221996; 69 pp
MSC: Primary 05; 15;

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.

Readership

Graduate students and research mathematicians interested in graphs and matrices.

  • Chapters
  • 1. Introduction
  • 2. Graph theory concepts
  • 3. Basic facts about the positive definite completion problem
  • 4. Examples
  • 5. Main result
  • 6. The implication $(1.0’) \Rightarrow (1.1)$
  • 7. The implication $(1.1) \Rightarrow (1.2)$
  • 8. The implication $(1.2) \Rightarrow (1.3)$
  • 9. The implication $(1.3) \Rightarrow (1.0)$
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.