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

The spectral radius of matrix continuous refinement operators

โœ Scribed by Victor Didenko; Wee Ping Yeo


Publisher
Springer
Year
2009
Tongue
English
Weight
394 KB
Volume
33
Category
Article
ISSN
1019-7168

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Linear operators preserving the sign-rea
โœ Bojana Zalar ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 105 KB

Define the sign-real spectral radius of a real n ร— n matrix A as ฯ s 0 (A) = max SโˆˆS ฯ 0 (SA), where ฯ 0 (A) = max{|ฮป|; ฮป a real eigenvalue of A} is the real spectral radius of A and S denotes the set of signature matrices, i.e. S = {S; |S| = I}, the absolute value of matrices being meant entrywise.

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