Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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.

share|cite|improve this question

Since the spectral norm of a matrix is bounded by the Frobenius norm, the eigenvalues of the matrix $A = (a_{ij})$ satisfy $|\lambda| \le \left(\sum_{i=1}^n \sum_{j=1}^n |a_{ij}|^2 \right)$. In particular, if the nonzero elements are bounded by $r$ and there are at most $k$ nonzero elements, $|\lambda| \le \sqrt{k} r$. This bound is sharp, in the sense that a $d \times d$ matrix whose entries are all $r$ has an eigenvalue $d r$.

share|cite|improve this answer
Excellent! Thank you! Could you point me to some references where I can read more about it? – Maniacka Sep 19 '12 at 18:59

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.