View Proposal #165
If this proposal belongs to you, you are authorized to update it. Use the menu on the right.
ID | 165 |
---|---|
First Name | Luz |
Last Name | De Alba |
Institution | Drake University |
Speaker Category | faculty |
Title of Talk | Comparison of P-matrix completions with Q-matrix completions. |
Abstract | A P-matrix is a real square matrix, in which the determinant of every principal submatrix is positive. A Q-matrix is one in which the sum of the determinants of principal submatrices of the same size is positive. Clearly every P-matrix is a Q-matrix. A partial P-matrix is a matrix in which some entries are specified while others are not known, and every fully specified principal submatrix has positive determinant. The P-matrix completion problem asks the question: "Which partial P-matrices can be completed to a P-matrix?" In this talk we give the definition of partial Q-matrix, and compare the Q-matrix completion problem to the P-matrix completion problem. We also discuss some partial answers to the Q-completion problem. |
Subject area(s) | Linear Algebra, Matrix Theory, Graph Theory |
Suitable for undergraduates? | Yes |
Day Preference | |
Computer Needed? | |
Bringing a laptop? | Y |
Overhead Needed? | N |
Software requests | |
Special Needs | |
Date Submitted | 3/2/2006 |
Year | 2006 |