An improved bi-conjugate residual algorithm suitable for distributed parallel computing
DOI10.1016/J.AMC.2006.07.143zbMATH Open1117.65047OpenAlexW2050455866MaRDI QIDQ884576FDOQ884576
Authors: Tongxiang Gu, Xianyu Zuo, Litao Zhang, Zhiqiang Sheng, 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
Recommendations
- An improved generalized conjugate residual squared algorithm suitable for distributed parallel computing
- Parallel version of generalized product-type bi-conjugate residual method suitable for distributed parallel computing
- An improved parallel hybrid bi-conjugate gradient method suitable for distributed parallel computing
- A parallelized conjugate A-orthogonal conjugate residual method suitable for distributed parallel computing
- An improved generalized conjugate residual squared (IGCRS2) algorithm suitable for distributed parallel computing
- scientific article; zbMATH DE number 2078928
- Implementation of different computational variations of biconjugate residual methods
- An improved GBPi-CG algorithm suitable for distributed parallel computing
- Parallel implementation of the block conjugate gradient algorithm
numerical examplesparallel computingconjugate gradient methodKrylov subspace methodlarge sparse linear systemsimproved bi-conjugate residual methodunsymmetrical coefficient matrices
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Iterative numerical methods for linear systems (65F10)
Cites Work
- Parallel iterative methods for sparse linear systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric 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
- Multiple search direction conjugate gradient method I: methods and their propositions
- Title not available (Why is that?)
- Numerical Linear Algebra for High-Performance Computers
- A performance model for Krylov subspace methods on mesh-based parallel computers
- Title not available (Why is that?)
Cited In (13)
- Minimizing synchronization in \(\text{IDR}(s)\).
- BiCGCR2: A new extension of conjugate residual method for solving non-Hermitian linear systems
- A parallel version of GPBi-CG method suitable for distributed parallel computing
- Conjugate residual squared method and its improvement for non-symmetric linear systems
- Title not available (Why is that?)
- Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
- A parallel generalized global conjugate gradient squared algorithm for linear systems with multiple right-hand sides
- An improved parallel hybrid bi-conjugate gradient method suitable for distributed parallel computing
- An improved GBPi-CG algorithm suitable for distributed parallel computing
- Parallel version of generalized product-type bi-conjugate residual method suitable for distributed parallel computing
- An improved generalized conjugate residual squared (IGCRS2) algorithm suitable for distributed parallel computing
- An improved generalized conjugate residual squared algorithm suitable for distributed parallel computing
- A parallelized conjugate A-orthogonal conjugate residual method suitable for distributed parallel computing
This page was built for publication: An improved bi-conjugate residual algorithm suitable for distributed parallel computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884576)
