×

zbMATH — the first resource for mathematics

Changing over stopping criterion for stable solving nonsymmetric linear equations by preconditioned conjugate gradient squared method. (English) Zbl 1441.65032
Summary: An improved preconditioned conjugate gradient squared (PCGS) algorithm has recently been proposed. This algorithm is more accurate and efficient than the conventional PCGS algorithm, and retains the advantages of the left-PCGS in terms of a solution structure. In this paper, we propose a changing over stopping criterion for the improved PCGS, that results in a higher accuracy than the conventional and the left-PCGS. A series of numerical results illustrate the stable solving statuses and the enhanced effectiveness of the improved PCGS with changing over stopping criterion.
MSC:
65F08 Preconditioners for iterative methods
65F10 Iterative numerical methods for linear systems
65F50 Computational methods for sparse matrices
Software:
CGS; Lis; SparseMatrix
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Sonneveld, P., CGS, a fast Lanczos-type solver for nonsymmetric linear systems, SIAM J. Sci. Stat. Comput., 10, 36-52 (1989) · Zbl 0666.65029
[2] Itoh, S.; Sugihara, M., Formulation of a preconditioned algorithm for the conjugate gradient squared method in accordance with its logical structure, Appl. Math., 6, 1389-1406 (2015)
[3] Itoh, S.; Sugihara, M., Structure of the preconditioned system in various preconditioned conjugate gradient squared algorithms, Res. Appl. Math., 3, Article 100008 pp. (2019)
[4] Itoh, S.; Sugihara, M., Systematic performance evaluation of linear solvers using quality control techniques, (Naono, K.; etal., Software Automatic Tuning from Concepts To State-of-the-Art Results (2010), Springer), 135-152
[5] Ashby, S. F.; Holst, M. J.; Manteuffel, A.; Saylor, P. E., The role of the inner product in stopping criteria for conjugate gradient iterations, BIT, 41, 26-52 (2001) · Zbl 0984.65025
[6] T.A. Davis, The university of Florida sparse matrix collection, http://www.cise.ufl.edu/research/sparse/matrices/. · Zbl 1365.65123
[7] Matrix Market project, http://math.nist.gov/MatrixMarket/.
[8] SSI project, Lis: Library of iterative solvers for linear systems, http://www.ssisc.org/lis/.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.