3
$\begingroup$

I know that for a symmetric matrix $A$, diagonal dominance, i.e. $A_{ii} \ge \sum\limits_{j \ne i} |A_{ij}|$ implies positive semi-definiteness.

How about the other way? Does positive semi-definiteness imply diagonal dominance? Could you point to a proof or a counter example?

  • 0
    Yes, Robert. Thanks.2012-09-20

4 Answers 4

6

Quick counter example

>>> a=2*ones(3,3)+eye(3) a =     3   2   2    2   3   2    2   2   3  >>> eig(a) ans =     1.00000    1.00000    7.00000 
  • 2
    @RobertIsrael Oh, my bad! Sorry - blunder!2012-09-20
1

A $2 \times 2$ counterexample is $\pmatrix{a^2 & a\cr a & 1\cr}$ for $|a| \ne 1$.

0

Take the following matrix:

$ A=\left[ {\begin{array}{cc} 0 & 1 \\ 0 & 0 \\ \end{array} } \right] $

Notice that $A$ is positive semidefinite (it has a double eigenvalue at $\lambda=0$). But it is not diagonally dominant since $0=|A_{11}|<|A_{12}|=1$

  • 0
    The Question was: "Does positive semi-definiteness imply diagonal dominance?" But, you're right...2012-09-20
0

You can see link http://www.win.tue.nl/~aeb/srgbk/node16.html In that link, the author said that if ma trix symmetric and stricly diagonal dominant then A positve define.