A parallel generalized global conjugate gradient squared algorithm for linear systems with multiple right-hand sides
From MaRDI portal
Publication:747195
DOI10.1007/s40314-014-0158-3zbMath1326.65044OpenAlexW1965032304MaRDI QIDQ747195
Xing-Ping Liu, Xian-Yu Zuo, Tong-Xiang Gu, Li-Tao Zhang
Publication date: 23 October 2015
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-014-0158-3
parallel computationnumerical experimentKrylov subspace methodsglobal communicationgl-CGS algorithmglobal conjugate gradient squared algorithmmutiple right-hand sidessparse nonsymmetric linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A performance model for Krylov subspace methods on mesh-based parallel computers
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- Oblique projection methods for linear systems with multiple right-hand sides
- An improved bi-conjugate residual algorithm suitable for distributed parallel computing
- The block conjugate gradient algorithm and related methods
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Global FOM and GMRES algorithms for matrix equations
- Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
- A parallel version of QMRCGSTAB method for large linear systems in distributed parallel environments
- Convergence properties of block GMRES and matrix polynomials
- 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
- Multiple search direction conjugate gradient method I: methods and their propositions
- Conjugate residual squared method and its improvement for non-symmetric linear systems
