Sharp Bounds on the Spectral Radius of Nonnegative Matrices and Comparison to the Frobenius’ Bounds

In this paper, a new upper bound and a new lower bound for the spectral radius of a nοnnegative matrix are proved by using similarity transformations. These bounds depend only on the elements of the nonnegative matrix and its row sums and are compared to the well-established upper and lower Frobenius’ bounds. The proposed bounds are always sharper or equal to the Frobenius’ bounds. The conditions under which the new bounds are sharper than the Frobenius' ones are determined. Illustrative examples are also provided in order to highlight the sharpness of the proposed bounds in comparison with the Frobenius’ bounds. An application to linear invariant discrete-time nonnegative systems is given and the stability of the systems is investigated. The proposed bounds are computed with complexity O(n2).