Guys I was reading about CG method to solve the sparse systems. I came across that the method is defined for positive definite symmetric matrices. I was wondering does it converges for negative definite matrices too ?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
$Ax =b \iff (-A) x = -b$, and if $A$ is symmetric negative definite then $-A$ is symmetric positive definite. So you can use CG to solve $-Ax = -b$.