MPI Based Parallel Finite Element Approaches for Implicit Nonlinear Dynamic Analysis Employing Sparse PCG Solvers
IR@SERC: CSIR-Structural Engineering Research Centre, Chennai
View Archive Info| Field | Value | |
| Title |
MPI Based Parallel Finite Element Approaches for Implicit Nonlinear Dynamic Analysis Employing Sparse PCG Solvers
|
|
| Creator |
Rama Mohan Rao, A.
|
|
| Subject |
Parallel finite elements
PCG formulations Sparse matrices Message passing Domain decomposition |
|
| Description |
This paper presents three formulations combining domain decomposition based finite element method with linear preconditioned conjugate gradient (LPCG) technique for solving large-scale problems in structural mechanics on parallel processing machines. In the first formulation called the Global Interface Formulation (GIF), the PCG algorithm is applied on the assembled interface stiffness coefficient matrices of all submeshes. The second formulation called Local Submesh Formulation (LSF) operates on the local unassembled submesh matrices and the preconditioner is constructed using the local submesh information. In the third formulation called Local Interface Formulation (LIF), the sparse PCG algorithm is formulated using the unassembled local schur complement matrices of submeshes. Both diagonal and incomplete Cholesky preconditioners have been employed. These domain decomposition based PCG algorithms have been implemented within a finite element code for nonlinear implicit transient dynamic analysis. Time integration is performed using Newmark-b constant average acceleration method. The parallel finite element code uses an MPI-based message passing approach to provide portable parallel execution on shared, distributed and distributed shared memory computers. Numerical experiments have been conducted on PARAM-10000, an Indian parallel supercomputer to evaluate the performance of the implicit parallel nonlinear finite element code employing the three proposed PCG formulations. Numerical studies indicate that the proposed parallel PCG formulations are highly adaptive for parallel computing and superior in performance when compared to the conventional domain decomposition algorithm with parallel direct solver. The LSF formulation, which is amenable for efficient implementation of communications by way of overlapping with computations found to be superior in performance compared to other two PCG formulations.
|
|
| Date |
2009
2009 2005 |
|
| Type |
Article
|
|
| Identifier |
Advances in Engineering Software vol.36, 2005, pp.181–198
http://hdl.handle.net/123456789/50 |
|
| Language |
en
|
|
| Rights |
It is tried to respect the rights of the copyright holders to the best of the knowledge. If it is brought to our notice that the rights are violated then the item would be withdrawn.
|
|
| Publisher |
Elsevier
|
|