Please use this identifier to cite or link to this item:

TitleN-matrix completion problem
Author(s)Araújo, C. Mendes
Torregrosa, Juan R.
Urbano, Ana M.
KeywordsPartial Matrix
Matrix completion problem
Undirected graphs
completion problem
undirected graph
Issue date1-Oct-2003
JournalLinear 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.
AccessOpen access
Appears in Collections:CMAT - Artigos em revistas com arbitragem / Papers in peer review journals

Files in This Item:
File Description SizeFormat 
NmatC[1].pdf200,35 kBAdobe PDFView/Open

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID