Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/1471| Título: | N-matrix completion problem |
| Autor(es): | Araújo, C. Mendes Torregrosa, Juan R. Urbano, Ana M. |
| Palavras-chave: | Partial Matrix Matrix completion problem N-matrix Undirected graphs completion problem undirected graph |
| Data: | 1-Out-2003 |
| Editora: | Elsevier |
| Revista: | Linear Algebra and Its Applications |
| Citação: | "Linear algebra and its applications". ISSN 0024-3795. 372 (2003) 111-125. |
| Resumo(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. |
| Tipo: | Artigo |
| URI: | https://hdl.handle.net/1822/1471 |
| DOI: | 10.1016/S0024-3795(03)00500-7 |
| ISSN: | 0024-3795 |
| Arbitragem científica: | yes |
| Acesso: | Acesso aberto |
| Aparece nas coleções: |
Ficheiros deste registo:
| Ficheiro | Descrição | Tamanho | Formato | |
|---|---|---|---|---|
| NmatC[1].pdf | 200,35 kB | Adobe PDF | Ver/Abrir |
