.png){kind=icon}
返回
Parallel implementation of the finite element method using compressed data structures
.png){kind=icon}
PRE
AI
DOI：10.1007/s00466-007-0166-x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a parallel implementation of the finite element method designed for coarse-grain distributed memory architectures. The MPI standard is used for message passing and tests are run on a PC cluster and on an SGI Altix 350. Compressed data structures are employed to store the coefficient matrix and obtain iterative solutions, based on Krylov methods, in a subdomain-by-subdomain approach. Two mesh partitioning schemes are compared: non-overlapping and overlapping. The pros and cons of these partitioning methods are discussed. Numerical examples of symmetric and non-symmetric problems in two and three dimensions are presented.
Keyword:
parallel computing
message passing interface
compressed data structures
finite element method
期刊
IF:
3.8
论文数:
3.2K
被引数:
9.0K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
FETI based algorithms for contact problems:: scalability, large displacements and 3D Coulomb friction基于FETI的接触问题算法:: 可伸缩性，大位移和3D库仑摩擦
PREAI
分享收藏Implicit SUPG solution of Euler equations using edge-based data structures使用基于边的数据结构的Euler方程的隐式SUPG解
PREAI
分享收藏分享收藏
查看更多内容