The \(N\)-matrix completion problem under digraphs assumptions.
type: Item
instance of: scholarly article
title: The \(N\)-matrix completion problem under digraphs assumptions.
zbMATH Open document ID: 1067.15010
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: 2004-03-29T00:00:00Z
review text: A real partial matrix is an \(n \times n\) array in which some entries are specified, while the remaining entries are free to be chosen. An \(n \times n\) partial matrix is said to be \textit{combinatorially symmetric} if the \((i,j)\) entry is specified if and only if the \((j,i)\) entry is specified, and non-combinatorially symmetric in the opposite case. A completion of a partial matrix is the matrix obtained after choosing the values for the unspecified entries. A matrix completion problem asks which partial matrices have completions with a given property. An \(n \times n \) real matrix is called N-matrix if all its principal minors are negative; these matrices occur in several mathematical problems. An \(n \times n \) real partial matrix is called partial N-matrix if every completely specified principal submatrix is an N-matrix. The authors study the N-matrix completion problem and the case of partial matrices \(A = (a_{ij})\) such that \(a_{ij}\neq 0\) and \(sign(a_{ij})=(-1)^{i+j+1}\) provided that the entry \((i,j)\) is specified. The specified entries of an \(n \times n \) partial matrix can be described by the digraph \((V,E)\): the set of vertices is \(V=\{1, \dots , n\}\) and the pair \((i,j) \;, \;i \neq j \), is an edge if and only if the \((i,j)\) entry is specified. The authors give an affirmative answer to the \(N\)-matrix completion problem in the case that the associated digraph contains no cycle and in the case that it contains particular kinds of cycles.
reviewed by: Bambina Larato
Mathematics Subject Classification ID: 15A29
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 2062868
zbMATH Keywords: completion problem
zbMATH Keywords: \(N\)-matrix
zbMATH Keywords: directed graphs
zbMATH Keywords: Partial matrix
MaRDI profile type: Publication
full work available at URL: j.laa.2003.10.017
OpenAlex ID: W2070949687
cites work: Q4288578
cites work: Q4275391
cites work: The Production Coefficient Matrix and the Stolper-Samuelson Condition
cites work: On characterizing \(N\)-matrices using linear complementarity
cites work: \(N\)-matrix completion problem.
cites work: Q3206022
cites work: N-matrices
cites work: On the Alass of Complementary Cones and Lemke’s Algorithm
DOI: 10.1016/J.LAA.2003.10.017
description: scientific article; zbMATH DE number 2062868