.png){kind=icon}
返回
Parallel algebraic multigrid methods on distributed memory computers
.png){kind=icon}
PRE
AI
DOI：10.1137/S1064827501386237.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Algebraic multigrid methods are well suited as preconditioners for iterative solvers. We consider linear systems of equations which are sparse and symmetric positive definite and which stem from a finite element discretization of a second order self-adjoint elliptic partial differential equation or a system of them. Since preconditioners based on algebraic multigrid are very efficient, additional speedup can only be achieved by parallelization. In this paper, we propose a general parallel algebraic multigrid algorithm for finite element discretizations based on domain decomposition ideas which is well suited for distributed memory computers. This paper pays special attention to the coarsening strategy which has to be adapted in the parallel case. Moreover, a general framework of data distribution gives rise to a construction scheme for the prolongation operators.
Keyword:
algebraic multigrid methods
finite element method
domain decomposition data distribution
parallel iterative solvers
parallel multigrid preconditioners
distributed memory
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
Numerical modelling of dynamic spalling test on rock with an emphasis on the influence of pre-existing cracks岩石动态爆裂试验的数值模拟研究，重点关注预存裂纹的影响
OAAI
OAAI分享收藏
查看更多内容