Parallelization of EMAP3D based on element-by-element Jacobi preconditioned conjugate gradient method

被引:10
作者
Hsieh, KT [1 ]
机构
[1] Univ Texas, Inst Adv Technol, Austin, TX 78759 USA
关键词
conjugate gradient method; finite-element method; parallelization; PC-based Beowulf cluster;
D O I
10.1109/TMAG.2002.805875
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The demand for more accurate analyses of electromechanical systems, such as electromagnetic launchers and pulsed rotating power supplies, requires an increase in the size of the finite-element model of these systems. It is not uncommon for the number of unknowns for such a model to reach a half million. A parallel computing system with multiple processors and distributed memory, such as a PC cluster, makes it possible to obtain solutions for large-scale problems in reasonable times. In order to utilize this parallel hardware architecture, the. software needs to be parallelized accordingly. Electromechanical Analysis Program in Three Dimensions (EMAP3D) is parallelized based on the element-by-element Jacobi preconditioned conjugate gradient (EBEJPCG) method because it is easily adopted into a parallel scheme and has low memory requirements because the formation of the global matrix is not necessary. The details of this algorithm are described in this paper. A block armature railgun was used to investigate this parallel algorithm on the Institute for Advanced Technology's (IAT's) eight-node PC-based Beowulf cluster. The performance of the algorithm in terms of speed-up ratio is presented.
引用
收藏
页码:139 / 141
页数:3
相关论文
共 3 条