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 …

The inverse elementary divisor problem for nonnegative matrices asks for necessary and
sufficient conditions for the existence of a nonnegative matrix with prescribed elementary …

A list of eigenvalues is said to be realizable if it is the spectrum of a nonnegative matrix,
diagonalizably realizable (DR) if it is the spectrum of a diagonalizable nonnegative matrix …

A general method is given for merging blocks in the Jordan canonical form of a nonnegative
matrix. As a consequence, results, more general than any prior ones, are given for the …

The nonnegative inverse eigenvalue problem (NIEP) is the problem of finding conditions for
the existence of an n× n entrywise nonnegative matrix A with prescribed spectrum. This …

In this note, we present a generalization of some results concerning the spectral properties
of a certain class of block matrices. As applications, we study some of its implications on …

The symmetric nonnegative inverse eigenvalue problem (SNIEP) asks for necessary and
sufficient conditions in order that a list of real numbers be the spectrum of a symmetric …

A method is developed to show that certain spectra cannot be realized for the S-NIEP. It is
applied in the 5-by-5 case to rule out many spectra that were previously unresolved. These …

We consider the problem of constructing nonnegative matrices with prescribed extremal
singular values. In particular, given 2n− 1 real numbers σ1 (j) and σj (j), j= 1,…, n, we …

We say that a list $\Lambda=\{\lambda _ {1},\ldots,\lambda _ {n}\} $ of complex numbers is
realizable, if it is the spectrum of a nonnegative matrix $ A $(the realizing matrix). We say …