Generalized conjugate gradient squared

From MaRDI portal





A generalized conjugate gradient squared method for solving nonsymmetric linear systems of equations is proposed. Instead of squaring the Bi-CG polynomial as in the conjugate gradient squared (CGS) method, the authors use a product of two nearby Bi-CG polynomials. Therefore, the CGS method is a special case of the proposed generalized CGS method. Numerical examples show that the present approach leads to algorithms with better convergence properties. Furthermore, it is shown that the application of the generalized CGS method as inner iteration method within a Newton's scheme may decrease the number of Newton steps significantly.




Cited in
(34)


Describes a project that uses

Uses Software






This page was built for publication: Generalized conjugate gradient squared

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1919946)