Bounds via spectral radius-preserving row sum expansions
Abstract
We show a simple method for constructing larger matrices but preserving the spectral radius. This yields a sufficient criteria for two square matrices of arbitrary dimension have the same spectral radius, a way to compare spectral radii of two matrices, and a way to derive new upper and lower bounds on spectral radius which give the standard row sum bounds as a special case.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.