Matthew A Grayson
Journal of Complexity
We first derive the bound |det(λI - A)|≤λk - λk0 (λ0≤λ), where A is a k × k nonnegative real matrix and λ0 is the spectral radius of A. If A is irreducible and integral, and its largest nonnegative eigenvalue is an integer n, then we use this inequality to derive the upper bound nk-1 on the components of the smallest integer eigenvector corresponding to n. Finer information on the components is also derived. © 1987.
Matthew A Grayson
Journal of Complexity
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
J. LaRue, C. Ting
Proceedings of SPIE 1989
R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering