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

How to estimate the largest eigenvalue of followed characteristics? Let $A={a_{ij}}$.

  1. Symmetric positive definite. Real. Very sparse.
  2. Diagonal elements are all positive, and off-diagonal elements are all negative.
  3. $a_{ii} $ equals to the negative of the sum of the rest elements of that row/column. $a_{ii}=-\sum^{k=n}_{k=1}a_{ik}$, $k\neq i$.
  4. $a_{ij}$ in (-1, 1].

Is this type of matrix special enough to have its own largest eigenvalue estimation?

The reason of my question is, I have 12 example matrices have the forehead mentioned characteristics, size from 30 by 30 to 3000 by 3000, but I happen to find that their largest eigenvalue only ranges in (1, 2). Therefore I am wondering if it is due to these characteristics.

share|cite|improve this question
up vote 0 down vote accepted

You can always apply Gershgorin's lemma: given a square matrix $A$ with elements $a_{ij}$, define radiuses

$$r_i=\sum_{j=1..n,j\ne i}|a_{ij}|.$$

Then all eigenvalues of the matrix $A$ lie in the union

$$\bigcup_{i=1..n}\{z\in \Bbb C: |z-a_{ii}|\le r_i\}.$$

In your case this results in all eigenvalues lying in the set $[0,2]$.

share|cite|improve this answer

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.