Revisiting Schur's bound on the largest singular value
classification
🧮 math.FA
keywords
boundboundslargestschursingularvalueanaloguesasymptotically
read the original abstract
We give upper and lower bounds on the largest singular value of a matrix using analogues to walks in graphs. For nonnegative matrices these bounds are asymptotically tight. In particular, we improve a bound due to I. Schur.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.