Abstract

A class of regularized conjugate gradient methods is presented for solving large-scale sparse system of linear equations of which the coefficient matrix is an ill-conditioned skew-symmetric indefinite matrix. The convergence is proved and the possible choices of the parameters involved in the new methods are discussed in detail. Preliminary numerical computations show that the numerical behaviors of the new methods are superior to those of some standard Krylov subspace methods, such as CGNE, CGS, GMRES etc.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call