Please use this identifier to cite or link to this item:
|Title:||N-matrix completion problem|
|Author(s):||Araújo, C. Mendes|
Torregrosa, Juan R.
Urbano, Ana M.
Matrix completion problem
|Journal:||Linear Algebra and Its Applications|
|Citation:||"Linear algebra and its applications". ISSN 0024-3795. 372 (2003) 111-125.|
|Abstract(s):||An n x n matrix is called an N-matrix if all principal minors are negative. In this paper, we are interested in N-matrix completion problems, that is, when a partial N-matrix hás an N-matrix completion. In general, a combinatorially or non-combinatorially symmetric partial N-matrix does not have an N-matrix completion. Here we prove that a combinatorially symmetric partial N-matrix has an N-matrix completion if the graph of its specified entries is a 1-chordal graph. We also prove that there exists an N-matrix completion for a partial N-matrix whose associated graph is an undirected cycle.|
|Appears in Collections:||CMAT - Artigos em revistas com arbitragem / Papers in peer review journals|