RT info:eu-repo/semantics/article
T1 The NIEP
A1 Johnson, Charles R.
A1 Marijuán López, Carlos
A1 Paparella, Pietro
A1 Pisonero Pérez, Miriam
K1 Nonnegative matrices
K1 Matrices no negativas
K1 Eigenvalue problem
K1 Problema de valor propio
K1 Symmetry
K1 Simetría
AB The nonnegative inverse eigenvalue problem (NIEP) asks whichlists of n complex numbers (counting multiplicity) occur as the eigenvalues ofsome n-by-n entry-wise nonnegative matrix. The NIEP has a long history andis a known hard (perhaps the hardest in matrix analysis?) and sought afterproblem. Thus, there are many subproblems and relevant results in a varietyof directions. We survey most work on the problem and its several variants,with an emphasis on recent results, and include 130 references. The surveyis divided into: a) the single eigenvalue problems; b) necessary conditions; c)low-dimensional results; d) sufficient conditions; e) appending 0’s to achieverealizability; f) the graph NIEP’s; g) Perron similarities; and h) the relevanceof Jordan structure.
PB Springer Link
SN 0255-0156
YR 2018
FD 2018
LK http://uvadoc.uva.es/handle/10324/35975
UL http://uvadoc.uva.es/handle/10324/35975
LA eng
NO Operator Theory: Advances and Applications, 2018, vol. 267. p. 199–220
NO Producción Científica
DS UVaDOC
RD 24-nov-2024