An improved bi-conjugate residual algorithm suitable for distributed parallel computing
DOI10.1016/j.amc.2006.07.143zbMath1117.65047OpenAlexW2050455866MaRDI QIDQ884576
Li-Tao Zhang, Zhiqiang Sheng, Tong-Xiang Gu, Xian-Yu Zuo, Wan Qin Zhang
Publication date: 6 June 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.07.143
numerical examplesconjugate gradient methodparallel computingKrylov subspace methodlarge sparse linear systemsimproved bi-conjugate residual methodunsymmetrical coefficient matrices
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)
Related Items (10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A performance model for Krylov subspace methods on mesh-based parallel computers
- 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
- Numerical Linear Algebra for High-Performance Computers
- Multiple search direction conjugate gradient method I: methods and their propositions
This page was built for publication: An improved bi-conjugate residual algorithm suitable for distributed parallel computing