Sharp bounds on the spectral radius of nonnegative matrices and comparison to the frobenius’ bounds
Date
2020Language
en
Sujet
Résumé
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). © 2020, North Atlantic University Union. All rights reserved.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Agent placement in wireless embedded systems: Memory space and energy optimizations
Tziritas, N.; Loukopoulos, T.; Lalis, S.; Lampsas, P. (2010)Embedded applications can be structured in terms of mobile agents that are flexibly installed on available nodes. In wireless systems, such nodes typically have limited battery and memory resources; therefore it is important ... -
Characterization of the allowable perturbations for disturbance rejection and data sensitivity
Koumboulis, F. N. (1996)In this paper the problem of disturbance rejection and data sensitivity is studied for the case of linear time invariant systems. Using a proportional state feedback law, the necessary and sufficient conditions for the ... -
Improving the Performance of the Continued Fractions Method Using New Bounds of Positive Roots
Akritas, A. G.; Strzebonski, A. W.; Vigklas, P. S. (2008)In this paper we compare four implementations of the Vincent-Akritas-Strzebonski Continued Fractions (VAS-CF) real root isolation method using four different (two linear and two quadratic complexity) bounds on the values ...