Determine if a matrix if positive definite
Given a symmetric matrix
[tex]A=\left(\begin{array}{ccccc} \sum a_{1s} & & & & \\ & \ddots & & a_{ij} \\ & & \ddots & & \\ &a_{ij} & & \ddots & \\ & & & & \sum w_{as} \end{array}\right) \in\mathbb{R}^{n\times n}, [/tex] with strictly positive entries a_{ij}, and with the diagonal entries being sum of offdiagonal entries residing in the corresponding row/column, how to proceed with the proof for A being positive definite, [tex] x^TAx>0 [/tex] for some nonzero vector x. 
Re: Determine if a matrix if positive definite
The http://en.wikipedia.org/wiki/Gershgorin_circle_theorem shows there are no negative eigenvalues, but it doesn't exclude the possibiltiy of zero eigenvalues (i.e. a singular matrix).
In fact the matrix $$\begin{pmatrix}1 & 1 \\ 1 & 1 \end{pmatrix}$$ is singular, and therefore not positive definite. 
Re: Determine if a matrix if positive definite
Thanks for providing the example.
I guess the author of the book stating the above positivedefiniteness on the given matrix type somehow misinterpreted it. 
Re: Determine if a matrix if positive definite
Quote:

Re: Determine if a matrix if positive definite
This is true because the matrix is diagonally dominant. There is a theorem that says a Hermitian diagonally dominant matrix with real nonnegative diagonal entries is positive semidefinite. A proof of this is found here http://planetmath.org/?op=getobj&from=objects&id=7483

Re: Determine if a matrix if positive definite
It can be shown that the inequality holds for n>3, but not in general case, as is observed above.

All times are GMT 5. The time now is 05:30 AM. 
Powered by vBulletin Copyright ©2000  2014, Jelsoft Enterprises Ltd.
© 2014 Physics Forums