An improved GBPi-CG algorithm suitable for distributed parallel computing
DOI10.1016/J.AMC.2009.11.044zbMATH Open1186.65041OpenAlexW2060561661MaRDI QIDQ961601FDOQ961601
Authors: Xianyu Zuo, Tongxiang Gu, Zeyao Mo 
Publication date: 31 March 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2009.11.044
Recommendations
- A parallel version of GPBi-CG method suitable for distributed parallel computing
- An improved parallel hybrid bi-conjugate gradient method suitable for distributed parallel computing
- Parallel version of generalized product-type bi-conjugate residual method suitable for distributed parallel computing
- An improved bi-conjugate residual algorithm suitable for distributed parallel computing
- scientific article; zbMATH DE number 2078928
numerical exampleKrylov subspaceglobal communicationdistributed parallel environmentsgeneralized product-type bi-conjugate gradient methodIGPBi-CG methodsparse unsymmetrical linear systems
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Iterative numerical methods for linear systems (65F10)
Cites Work
- GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Methods of conjugate gradients for solving linear systems
- 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
- Title not available (Why is that?)
- An extension of the conjugate residual method to nonsymmetric linear systems
- An improved bi-conjugate residual algorithm suitable for distributed parallel computing
- 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
- On Deriving the Quasi-Minimal Residual Method
- A performance model for Krylov subspace methods on mesh-based parallel computers
- Title not available (Why is that?)
Cited In (14)
- A parallel version of GPBi-CG method suitable for distributed parallel computing
- An improved bi-conjugate residual algorithm suitable for distributed parallel computing
- Title not available (Why is that?)
- Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
- Title not available (Why is that?)
- The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR
- The application of the generalized product-type method based on Bi-CG to accelerate the sparse-matrix/canonical grid method
- An improved parallel hybrid bi-conjugate gradient method 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 ICGS algorithm suitable for distributed parallel computing
- Improved QMRCGSTAB method in distributed parallel environments
- An improved generalized conjugate residual squared algorithm suitable for distributed parallel computing
- Alternating Anderson-Richardson method: an efficient alternative to preconditioned Krylov methods for large, sparse linear systems
Uses Software
This page was built for publication: An improved GBPi-CG 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 Q961601)
