For an n X n matrix whose entries are constrained to be in some [x,y], is the maximum absolute eigenvalue of the matrix a function of its sparsity? Is there a closed-form expression that states this function? 'Sparsity' could mean slightly different things. Lets say that it refers to the proportion of zero-valued entries, for starters.
Eigenvalues vs.matrix sparsity
1
$\begingroup$
linear-algebra
matrices
eigenvalues-eigenvectors