On the comparison of some realizability criteria for the real nonnegative inverse eigenvalue problem (Q1763832)

The authors revisit the nonnegative matrix inverse eigenvalue problem of finding sufficient conditions for a set of numbers such that there exists an elementwise nonnegative matrix with these numbers as its eigenvalues. They do this in the light of \textit{A. Brauer}'s Theorem [Duke Math. J. 19, 75--91 (1952; Zbl 0046.01202)] and thereby show the centrality of Brauer's Theorem for this problem. In fact they derive many known results in this area anew and constructively from it. Brauer's Theorem allows to change one matrix eigenvalue through a rank one perturbation of a given matrix while keeping all other eigenvalues the same. Brauer's eigenvalue modification technique also gives rise to a constructive algorithm for realizing a nonnegative matrix with a feasibly prescribed spectrum. Finally the paper compares the realizability criteria for the nonnegative inverse eigenvalue problem of \textit{R. B. Kellogg} [Linear Algebra Appl. 4, 191--204 (1971; Zbl 0215.37504)], \textit{A. Borobia} [Linear Algebra Appl. 223--224, 131--140 (1995; Zbl 0831.15014)], and \textit{R. L. Soto} and \textit{O. Rojo} [Linear Algebra Appl. 368, 53--69 (2003; Zbl 1031.15017)] and finds Soto's criterion to be the most general one.