.png){kind=icon}
返回
An improved bi-conjugate residual algorithm suitable for distributed parallel computing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2006.07.143.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
An improved bi-conjugate residual (BiCR) method (IBiCR method, in brief) for solving large sparse linear systems with unsymmetrical coefficient matrices was proposed for distributed parallel environments. The method reduced two global synchronization points to one by reconstructing BiCR method and all inner products per iteration were independent and communication time required for inner product can be overlapped efficiently with computation time of vector updates. It combines the elements of numerical stability with the characters of design of parallel algorithms. The cost is only a little increased computation. Performance and isoefficiency analysis shows that IBiCR method has better parallelism and scalability than BiCR method. Numerical experiments show that the parallel performance can be improved by a factor of about 2. We compared also IBiCR with IBiCG and BiCR with BiCG methods. The results show that BiCR and IBiCR methods convergent at the same number of iteration, and they convergent faster than BiCG and IBiCG methods, respectively. Furthermore, IBiCR method conquers the vibration of residual norm of IBiCG method. (c) 2006 Elsevier Inc. All rights reserved.
Keyword:
IBiCR method
Krylov subspace
sparse unsymmetrical
linear systems
synchronization overhead
parallel computing
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
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
分享收藏
没有更多内容
没有更多内容