.png){kind=icon}
返回
A scalable parallel algorithm for incomplete factor preconditioning
.png){kind=icon}
PRE
AI
DOI：10.1137/S1064827500376193.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We describe a parallel algorithm for computing incomplete factor (ILU) preconditioners. The algorithm attains a high degree of parallelism through graph partitioning and a two-level ordering strategy. Both the subdomains and the nodes within each subdomain are ordered to preserve concurrency. We show through an algorithmic analysis and through computational results that this algorithm is scalable. Experimental results include timings on three parallel platforms for problems with up to 20 million unknowns running on up to 216 processors. The resulting preconditioned Krylov solvers have the desirable property that the number of iterations required for convergence is insensitive to the number of processors.
Keyword:
incomplete factorization
ILU
preconditioning
parallel preconditioning
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
暂无机构信息
引用论文
Photoluminescence properties of partially phase separated silicon nitride films部分相分离氮化硅薄膜的光致发光特性
PREAI
分享收藏Polysome fractionation analysis reveals features important for human nonsense-mediated mRNA decay.png)
OAAI
IF0
OAAI分享收藏分享收藏
查看更多内容