2018 | OriginalPaper | Chapter
The NIEP
Authors : Charles R. Johnson, Carlos Marijuán, Pietro Paparella, Miriam Pisonero
Published in: Operator Theory, Operator Algebras, and Matrix Theory
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The nonnegative inverse eigenvalue problem (NIEP) asks which lists of n complex numbers (counting multiplicity) occur as the eigenvalues of some n-by-n entry-wise nonnegative matrix. The NIEP has a long history and is a known hard (perhaps the hardest in matrix analysis?) and sought after problem. Thus, there are many subproblems and relevant results in a variety of directions. We survey most work on the problem and its several variants, with an emphasis on recent results, and include 130 references. The survey is divided into: a) the single eigenvalue problems; b) necessary conditions; c) low-dimensional results; d) sufficient conditions; e) appending 0’s to achieve realizability; f) the graph NIEP’s; g) Perron similarities; and h) the relevance of Jordan structure.