An improved parallel hybrid bi-conjugate gradient method suitable for distributed parallel computing
From MaRDI portal
Publication:1008661
DOI10.1016/j.cam.2008.05.017zbMath1166.65327OpenAlexW2011740685MaRDI QIDQ1008661
Xing-Ping Liu, Tong-Xiang Gu, Pei-Lu Li, Xian-Yu Zuo
Publication date: 30 March 2009
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2008.05.017
Krylov subspace methodglobal communicationdistributed parallel environmentsIBiCGSTAB(2) methodsparse nonsymmetric linear system
Related Items
Minimizing synchronization in IDR (s ), Minimizing synchronizations in sparse iterative solvers for distributed supercomputers, A parallel version of GPBi-CG method suitable for distributed parallel computing, Modelling and simulation of a polluted water pumping process
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A performance model for Krylov subspace methods on mesh-based parallel computers
- An improved bi-conjugate residual algorithm suitable for distributed parallel computing
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- 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
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- On Deriving the Quasi-Minimal Residual Method
- Multiple search direction conjugate gradient method II: theory and numerical experiments
- Multiple search direction conjugate gradient method I: methods and their propositions
