Two efficient inexact algorithms for a class of large sparse complex linear systems (Q305900): Difference between revisions

The paper is concerned with the iterative numerical solution of complex nonsingular systems of linear equations. The authors propose an inexact variant of the generalized successive overrelaxation method, in which the conjugate gradient and the preconditioned conjugate gradient methods are regarded as its inner iterations. They prove convergence of the new method and provide numerical experiments.