Structure of the preconditioned system in various preconditioned conjugate gradient squared algorithms

DOI10.1016/J.RINAM.2019.100008MaRDI QIDQ2211057zbMATH OpenOpenAlexFDO

Authors Shoji Itoh, Masaaki Sugihara

Publication date 10 November 2020

Published in Results in Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/1603.00176

zbMATH Keywords

congruence of preconditioning conversionpreconditioned conjugate gradient squared methodpreconditioned Krylov subspace method

Mathematics Subject Classification ID

Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)

Abstract: An improved preconditioned conjugate gradient squared (PCGS) algorithm has recently been proposed, and it performs much better than the conventional PCGS algorithm. In this paper, the improved PCGS algorithm is verified as a coordinative to the left-preconditioned system, and it has the advantages of both the conventional and the left-PCGS; this is done by comparing, analyzing, and executing numerical examinations of various PCGS algorithms, including another improved one. We show that the direction of the preconditioned system for the CGS method is determined by the operations of $alph{a}_k$ and $$ in the PCGS algorithm. By comparing the logical structures of these algorithms, we show that the direction of the preconditioned system can be switched by the construction and setting of the initial shadow residual vector.

Recommendations

• Preconditioners for the conjugate gradient algorithm using Gram–Schmidt and least squares methods
• scientific article; zbMATH DE number 3844481
• scientific article; zbMATH DE number 176182
• Preconditioned conjugate gradient methods applied to certain symmetric linear systems
• Preconditioned conjugate gradient methods for the solution of indefinite least squares problems
• Preconditioned conjugate gradient method for generalized least squares problems
• Preconditioning conjugate gradient method for nonsymmetric systems
• Iteratively constructing preconditioners via the conjugate gradient method
• Preconditioning and the conjugate gradient method in the context of solving PDEs
• Preconditioned conjugate gradients for solving singular systems

Cites work

• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
• scientific article; zbMATH DE number 3511513 (Why is no real title available?)
• scientific article; zbMATH DE number 1323248 (Why is no real title available?)
• scientific article; zbMATH DE number 783533 (Why is no real title available?)
• On Lanczos-type methods for Wilson fermions
• The University of Florida sparse matrix collection

Cited in

(3)

• The construction of an algebraically reduced system for the acceleration of preconditioned conjugate gradients
• Improvement of preconditioned bi-Lanczos-type algorithms with residual norm minimization for the stable solution of systems of linear equations
• Changing over stopping criterion for stable solving nonsymmetric linear equations by preconditioned conjugate gradient squared method

Describes a project that uses

Uses Software

• SparseMatrix
• Lis

This page was built for publication: Structure of the preconditioned system in various preconditioned conjugate gradient squared algorithms

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