Browsing by Subject "Matrix cones"

Now showing items 1-2 of 2

    • Graphs with sparsity order at most two: the complex case 

      Ter Horst, S.; Klem, E.M. (Taylor & Francis, 2017)
      The sparsity order of a (simple undirected) graph is the highest possible rank (over or ) of the extremal elements in the matrix cone that consists of positive semidefinite matrices with prescribed zeros on the positions ...

    • Non-chordal patterns associated with the positive definite completion problem 

      Klem, Estiaan Murrell (North-West University, 2015)
      A partial matrix, is a matrix for which some entries are specified and some unspecified. In general completion problems ask whether a given partial matrix, may be completed to a matrix where all the entries are specified, ...