Please use this identifier to cite or link to this item: https://hdl.handle.net/1822/11155

 Title: N_0 completions on partial matrices Author(s): Araújo, C. MendesTorregrosa, Juan R.Jordán, Cristina Keywords: Partial matrixN_0-matrixCompletionChordal graphsCycleChordal graphN -matrix 0 Issue date: 15-May-2009 Publisher: Elsevier Journal: Applied Mathematics and Computation Citation: "Applied Mathematics and Computation". ISSN 0096-3003. 211:2 (May 2009) 303-312. Abstract(s): An $n\times n$ matrix is called an $N_0$-matrix if all its principal minors are nonpositive. In this paper, we are interested in $N_0$-matrix completion problems, that is, when a partial $N_0$-matrix has an $N_0$-matrix completion. In general, a combinatorially or non-combinatorially symmetric partial $N_0$-matrix does not have an $N_0$-matrix completion. Here, we prove that a combinatorially symmetric partial $N_0$-matrix, with no null main diagonal entries, has an $N_0$-matrix completion if the graph of its specified entries is a 1-chordal graph or a cycle. We also analyze the mentioned problem when the partial matrix has some null main diagonal entries. Type: Article URI: https://hdl.handle.net/1822/11155 DOI: 10.1016/j.amc.2009.01.063 ISSN: 0096-3003 Publisher version: http://www.sciencedirect.com/science/journal/00963003 Peer-Reviewed: yes Access: Open access Appears in Collections: CMAT - Artigos em revistas com arbitragem / Papers in peer review journals

Files in This Item:
File Description SizeFormat