1
$\begingroup$

I have a large sparse matrix which is symmetric for the location of non zero values, but the values are different. Could I still use the CG method? I don't have much knowledge of linear algebra, the matrix comes form the discretization of some PDEs and is very large, GMRES method is not appealing because of the need of the calculation with Arnoldi algorithm and storage of the basis.

$\endgroup$
3
$\begingroup$

The BiConjugate Gradient method (BiCG) or its stabilized variant (BiCGSTAB) are Krylov subspace methods that are designed to work on non-symmetric matrices. Given a choice between the two, you should use BiCGSTAB, since it tends to converge more quickly. https://en.wikipedia.org/wiki/Biconjugate_gradient_stabilized_method

$\endgroup$
  • $\begingroup$ Thank you very much, it seems to be exactly what I was looking for! $\endgroup$ – geeva beeva Apr 22 '18 at 17:35

Your Answer

By clicking "Post Your Answer", you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.