A parallel version of GPBi-CG method suitable for distributed parallel computing
DOI10.1007/S40314-014-0206-ZzbMATH Open1370.65017OpenAlexW2014378721MaRDI QIDQ2013626FDOQ2013626
Authors: Xianyu Zuo, Litao Zhang, Fengbin Zheng, Tongxiang Gu, Ning Li 
Publication date: 8 August 2017
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-014-0206-z
Recommendations
- 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 parallel hybrid bi-conjugate gradient method suitable for distributed parallel computing
- An improved bi-conjugate residual algorithm suitable for distributed parallel computing
- scientific article; zbMATH DE number 2078928
performanceparallel algorithmnumerical experimentnumerical stabilityKrylov subspaceglobal communicationdistributed parallel environmentssparse unsymmetrical linear systemsgeneralized product-type bi-conjugate method
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
- 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
- IDR(\(s\)): A family of simple and fast algorithms for solving large nonsymmetric systems of linear equations
- Title not available (Why is that?)
- An improved bi-conjugate residual algorithm suitable for distributed parallel computing
- An improved parallel hybrid bi-conjugate gradient method 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 II: theory and numerical experiments
- Multiple search direction conjugate gradient method I: methods and their propositions
- Title not available (Why is that?)
- A performance model for Krylov subspace methods on mesh-based parallel computers
- A cooperative conjugate gradient method for linear systems permitting efficient multi-thread implementation
- Title not available (Why is that?)
- Communication Avoiding ILU0 Preconditioner
Cited In (9)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A parallel generalized global conjugate gradient squared algorithm for linear systems with multiple right-hand sides
- A comparison of parallel implementation of explicit DG and central difference method
- 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 ICGS algorithm suitable for distributed parallel computing
- A parallel version of QMRCGSTAB method for large linear systems in distributed parallel environments
Uses Software
This page was built for publication: A parallel version of GPBi-CG method suitable for distributed parallel computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013626)
