Revisiting Schur's bound on the largest singular value

2007/02/24 by Vladimir Nikiforov, Nikiforov, Vladimir
Mathematics · #15A60 #FOS: Mathematics #Functional Analysis (math.FA) #math.FA #msc:15A60

paper · pdf · doi:10.48550/arxiv.math/0702722

arxiv created 2007/03/06 · arxiv updated 2009/12/01

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.

Related

• Regular, pseudo-regular, and almost regular matrices
• Graphs and Hermitian matrices: exact interlacing
• On the sum of k largest singular values of graphs and matrices
• Two new lower bounds for the smallest singular value
• Extrema of graph eigenvalues