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

`https://hdl.handle.net/1822/1471`

Title: | N-matrix completion problem |

Author(s): | Araújo, C. Mendes Torregrosa, Juan R. Urbano, Ana M. |

Keywords: | Partial Matrix Matrix completion problem N-matrix Undirected graphs completion problem undirected graph |

Issue date: | 1-Oct-2003 |

Publisher: | Elsevier |

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. |

Type: | Article |

URI: | https://hdl.handle.net/1822/1471 |

DOI: | 10.1016/S0024-3795(03)00500-7 |

ISSN: | 0024-3795 |

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 | Size | Format | |
---|---|---|---|---|

NmatC[1].pdf | 200,35 kB | Adobe PDF | View/Open |