.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
IGPBi-CG method
Krylov subspace
Sparse unsymmetrical linear
Global communication
Distributed parallel environments
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
GPBi-CG: Generalized product-type methods based on Bi-CG for solving nonsymmetric linear systemsGpbi-cg: 基于bi-cg求解非对称线性系统的广义乘积型方法
.png){kind=icon}
PREAI
分享收藏
A parallel version of QMRCGSTAB method for large linear systems in distributed parallel environments
PREAI
分享收藏Critical current measurements of by the transformer methodsuperconducting cables通过变压器法的超导电缆临界电流测量
PREAI
分享收藏
查看更多内容