2
$\begingroup$

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 ?

  • 2
    Not directly, CG minimizes a convex quadratic. However, you could solve $(-A)x = (-b)$, or modify the algorithm by changing signs at appropriate places (as in the difference between minimization and maximization is 'just' a sign difference).2012-11-16

1 Answers 1