๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Bounds for the spectral radius and the largest singular value

โœ Scribed by O. Rojo; R. Soto; H. Rojo


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
396 KB
Volume
36
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis


We derive an increasing sequence of lower bounds for the spectral radius of a matrix with real spectrum and progressively improved bounds for the largest singular value of a complex matrix. We also find estimates for the rank of normal matrices with real spectrum and for the rank of normal nonnegative matrices, including some sufficient condition for such matrices to be invertible.


๐Ÿ“œ SIMILAR VOLUMES


Further bounds for the smallest singular
โœ O. Rojo ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 541 KB

We derive monotonic sequences of bounds for the extreme singular values. In particular, we find further lower bounds for the smallest singular value which improve the bounds of Yu and Gun. Also, we give new upper bounds for the spectral condition number. ~

Multiplicative perturbation bounds for s
โœ Wen Li ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 159 KB

Let H be a Hermitian matrix, and H = D \* H D be its perturbed matrix. In this paper, the multiplicative perturbations for both spectral decompositions and singular value decompositions are studied and some new perturbation bounds for these decompositions are presented. Our results improve some exis

Lower bounds for the spectral radius of
โœ Bill G. Horne ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 444 KB

We develop lower bounds for the spectral radius of symmetric, skew-symmetric, and arbitrary real matrices, Our approach utilizes the well-known Leverrier-Faddeev algorithm for calculating the coefficients of the characteristic polynomial of a matrix in conjunction with a theorem by Lucas which state

Further lower bounds for the smallest si
โœ Charles R. Johnson; Tomasz Szulc ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 464 KB

In an earlier paper of the first author, Gersgorin's theorem was used in a novel way to give a simple lower bound for the smallest singular value of a general complex matrix. That lower bound was stronger than previous published bounds. Here, we use three variants of Gersgorin's theorem in a similar