Changing over stopping criterion for stable solving nonsymmetric linear equations by preconditioned conjugate gradient squared method

DOI10.1016/j.aml.2019.106088zbMath1441.65032OpenAlexW2981195096WikidataQ127031732 ScholiaQ127031732MaRDI QIDQ2184899

Masaaki Sugihara, Shoji Itoh

Publication date: 2 June 2020

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2019.106088

zbMATH Keywords

linear systemsKrylov subspace methodpreconditioned algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Related Items

Improvement of preconditioned bi-Lanczos-type algorithms with residual norm minimization for the stable solution of systems of linear equations

Uses Software

• SparseMatrix
• CGS
• Lis

Cites Work

• Structure of the preconditioned system in various preconditioned conjugate gradient squared algorithms
• The university of Florida sparse matrix collection
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• The role of the inner product in stopping criteria for conjugate gradient iterations