A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems (Q1334205): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Harwell-Boeing sparse matrix collection / rank | |||
Normal rank | |||
Revision as of 17:46, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems |
scientific article |
Statements
A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems (English)
0 references
19 September 1994
0 references
A new variant of the conjugate gradients squared (CGS) algorithm for solving non-symmetric linear systems, which is based on squaring the composite step bi-conjugate gradient (CSBCG) method [see \textit{R. E. Bank} and \textit{T. F. Chan}, ibid. 7, No. 1, 1-16 (1994; Zbl 0809.65025)], is presented. The created composite step CGS (CSCGS) combines the advantages of CGS (no multiplications by the transposed matrix and a faster convergence rate than BCG) with the handling of pivot (also called true, Galerkin or hard) break-downs. The CSCGS algorithm is given and details of implementation are widely discussed. Three numerical examples prove the better performance over CGS.
0 references
Lanczos method
0 references
breakdowns
0 references
composite step
0 references
conjugate gradients squared algorithm
0 references
convergence
0 references
CSCGS algorithm
0 references
numerical examples
0 references
