Generalized conjugate gradient squared (Q1919946)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 910307
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized conjugate gradient squared |
scientific article; zbMATH DE number 910307 |
Statements
Generalized conjugate gradient squared (English)
0 references
24 February 1997
0 references
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.
0 references
Krylov subspace
0 references
nonlinear systems
0 references
numerical examples
0 references
conjugate gradient squared method
0 references
nonsymmetric linear systems
0 references
convergence
0 references
Newton's scheme
0 references
0 references
0 references
0 references
0 references
0.883944034576416
0 references
0.8500006198883057
0 references
0.8494664430618286
0 references
