.png){kind=icon}
Return
An improved GPBi-CG algorithm suitable for distributed parallel computing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2009.11.044.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An improved generalized product-type bi-conjugate gradient (GPBi-CG) method (IGPBi-CG method, in brief) for solving large sparse linear systems with unsymmetrical coefficient matrices is proposed for distributed parallel environments. The method reduces three global synchronization points to two by reconstructing GPBi-CG method and the communication time required for the inner product can be efficiently overlapped with useful computation. The cost is only slightly increased computation time, which can be ignored compared with the reduction of communication time. Performance and isoefficiency analysis show that the IGPBi-CG method has better parallelism and scalability than the GPB-iCG method. Numerical experiments show that the scalability can be improved by a factor greater than 1.5 and the improvement in parallel communication performance approaches 33.3%. (C) 2009 Elsevier Inc. All rights reserved.
Keywords:
IGPBi-CG method
Krylov subspace
Sparse unsymmetrical linear
Global communication
Distributed parallel environments
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
Cited Papers
GPBi-CG: Generalized product-type methods based on Bi-CG for solving nonsymmetric linear systems
.png){kind=icon}
PREAI
ShareSaveShareSaveShareSave
ShareSaveA parallel version of QMRCGSTAB method for large linear systems in distributed parallel environments
PREAI
ShareSave
View more