\(N\)-matrix completion problem.
type: Item
instance of: scholarly article
title: \(N\)-matrix completion problem.
zbMATH Open document ID: 1049.15008
DOI: 10.1016/S0024-3795(03)00500-7
author: C. Mendes Araújo
author: Juan Ramón Torregrosa Sánchez
author: Ana M. Urbano
published in: Linear Algebra and its Applications
publication date: 2003-10-15T00:00:00Z
review text: An \(n \times n\) matrix is called an \(N\)-matrix if all principal minors are negative. The authors 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. They also prove that there exists an \(N\)-matrix completion for a partial \(N\)-matrix whose associated graph is an undirected cycle.
reviewed by: Fuad Kittaneh
Mathematics Subject Classification ID: 15A29
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 1993122
zbMATH Keywords: N-matrix
zbMATH Keywords: partial matrix
zbMATH Keywords: completion problem
zbMATH Keywords: undirected graph
zbMATH Keywords: chordal graph
MaRDI profile type: Publication
cites work: Q4288578
cites work: The Production Coefficient Matrix and the Stolper-Samuelson Condition
cites work: On characterizing \(N\)-matrices using linear complementarity
cites work: Q3206022
cites work: N-matrices
cites work: On the Alass of Complementary Cones and Lemke’s Algorithm
full work available at URL: s0024-3795(03)00500-7
OpenAlex ID: W2019643208
description: scientific article; zbMATH DE number 1993122