On the location of eigenvalues of off-diagonal constant matrices (Q1077491)

In the convergence analysis of algorithms used to solve the spatial equilibrium problem, it is necessary to determine the value of some of the eigenvalues of a given off-diagonal constant matrix (i.e. a square real matrix expressible as the sum of a diagonal and a constant matrix) or at least tight bounds on these eigenvalues. The author derives new bounds which are particularly sharp whenever the standard methods using Gershgorin's theorem and related results are of little use.