Given Ax=λx, take i for which |xᵢ| is largest. Look at the i'th equation: sum aᵢⱼxⱼ = λxᵢ, move the aᵢᵢxᵢ term to the rhs, take absolute values, divide by |xᵢ|, apply triangle inequality, and you have |aᵢᵢ - λ| ≤ sum |aᵢⱼ| over j≠i. So for every eigenvalue you can find such a disc.
That's by column, for row use Aᵀ.
If you had played around a bit with Laplacian matrices, like tri-diagonal matrices with stencil [-1, 2, -1], and found that its eigenvalues are within 2 ± 2, and if you also realized that A + τI has the same eigenvalues shifted by τ, then it's a small step to consider that the magnitude of the off-diagonal may have something to do with the spread of eigenvalues.
It's likely that Gerschgorin stumbled upon it like this.
Just trying to understand these terms. So is a 5x5 tridiagonal matrix with your stencil look like this?
2 -1 0 0 0
-1 2 -1 0 0
0 -1 2 -1 0
0 0 -1 2 -1
0 0 0 -1 2See https://en.wikipedia.org/wiki/Compact_stencil#Three_Point_St...
Math 101, simple is better.
https://www.amazon.com/Matrix-Theory-Dover-Books-Mathematics...
https://ocw.mit.edu/courses/18-06-linear-algebra-spring-2010...
A common noise cancellation technique is to throw away small eigenvalues, as in PCA. This result relates eigenvalues to the structure of the matrix, so might be helpful for reducing ev's without bothering with diagonalization?
[Edit] This would presumably involve just zeroing out the rows with small diagonal elements and small-ish off-diagonal norm... Center the eigenvalue estimate disk at zero, and then zero out the rest of the row to make the estimate exact.
> The radius of the i_th disc is the absolute values
How can a radius of a single disc (i.e. a single value) correspond to multiple values?
r_i = \sum_{i \ne j} |A_{i j}|That line got me as well.
The answer to the above question is Gerschgorin disks and it's closely related cousin Brauer's Oval of Cassini.
For matrices with real eigenvalues it's moreso along the real number line, only for cases where the eigenvalues are imaginary do we imagine disks.
Not a proof or anything, of course the proof is on Wikipedia and nice and elegant. Just a thought on the gut feeling.
I agree that it is a very nice result.
The diagonal elements of matrices have a lot of rather "magical" properties if you think about it. Their sum is also the sum of the eigenvalues of the matrix. And if you have a matrix A that is singular, you can choose any value x that is not an eigenvalue, and then A - xI is invertible but still mostly behaves like A.
It's rather remarkable, unexpected, and perhaps shocking, when you first hear it. There does not seem to be enough information to make it true. But it is.
I used it in a real project to cancel noise.