Structure of the preconditioned system in various preconditioned conjugate gradient squared algorithms
From MaRDI portal
Publication:2211057
DOI10.1016/j.rinam.2019.100008zbMath1452.65061arXiv1603.00176MaRDI QIDQ2211057
Publication date: 10 November 2020
Published in: Results in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.00176
preconditioned conjugate gradient squared method; preconditioned Krylov subspace method; congruence of preconditioning conversion
Related Items
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
Uses Software
Cites Work
- The university of Florida sparse matrix collection
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item