scholarly journals An Efficient Parallel Finite-Element-Based Domain Decomposition Iterative Technique With Polynomial Preconditioning

2005 ◽  
Author(s):  
Yu Liang ◽  
Ramdev Kanapady ◽  
Kumar Tamma
Keyword(s):  
Finite Element ◽  
Domain Decomposition ◽  
Iterative Technique ◽  
Polynomial Preconditioning ◽  
Parallel Finite Element

A Domain Decomposition Study for a Parallel Finite Element Code

1992 ◽  
Author(s):  
J. Rodriguez ◽  
J. Sun
Keyword(s):  
Finite Element ◽  
Domain Decomposition ◽  
Performance Criteria ◽  
Communication Overhead ◽  
Decomposition Algorithms ◽  
System Matrix ◽  
Single Wave ◽  
Parallel Finite Element ◽  
Computational Structural Mechanics ◽  
Parallel Fem

Abstract The primary objective of this study was the implementation and comparison of domain decomposition algorithms for a parallel Finite Element Method (FEM) used in the area of Computational Structural Mechanics (CSM). A parallelized FEM code exploits the concurrency inherent in the method to improve its computational efficiency. In order to use a larger size granularity in the parallel computation, the parallel FEM needs to partition its domain into subdomains in a proper manner. It is therefore necessary to search for domain decomposition algorithms to satisfy the special requirements of a parallel FEM. The domain decomposition algorithms investigated in this study physically decompose a meshed domain into a desired number of subdomains. Addressing the requirements of the parallel FEM, these algorithms are able to handle any type of two- and three-dimensional domains, balance the workloads across the multiple processors, minimize the communication overhead among the processors, maintain the integrity of each subdomain, minimize the overall bandwidth of the resulting system matrix, and require only a small amount of CPU time for the decomposition. Modifications to existing decomposition algorithms, such as the single wave propagating method and the bisecting method using vertical/horizontal cuts, are investigated. A new algorithm, based on the proposed multiple wave propagating method and the bisecting method using middle cuts, is formulated. These algorithms are compared with each other using performance criteria based on the overall FEM code and the algorithms themselves. An optimal combination algorithm is proposed. This algorithm combination is flexible and intelligent in some sense since several judgements are suggested to guide and organize different decompositions based on the general geometry of the meshes. The combination algorithm possesses both the desirable features of wave propagating and bisecting methods. As an application, the present algorithm is included in an existing parallel FEM code and some improvements in this code are made. The overall efficiency of the FEM code was increased.

Large-Scale Parallel Finite Element Analysis of the Stress Singular Problems

2002 ◽  
Author(s):  
Noriyuki Kushida ◽  
Hiroshi Okuda ◽  
Genki Yagawa
Keyword(s):  
Finite Element ◽  
Domain Decomposition ◽  
Conjugate Gradient Method ◽  
Conjugate Gradient ◽  
Gradient Method ◽  
Large Scale ◽  
Preconditioned Conjugate Gradient Method ◽  
Preconditioned Conjugate Gradient ◽  
Singular Problems ◽  
Parallel Finite Element

In this paper, the convergence behavior of large-scale parallel finite element method for the stress singular problems was investigated. The convergence behavior of iterative solvers depends on the efficiency of the preconditioners. However, efficiency of preconditioners may be influenced by the domain decomposition that is necessary for parallel FEM. In this study the following results were obtained: Conjugate gradient method without preconditioning and the diagonal scaling preconditioned conjugate gradient method were not influenced by the domain decomposition as expected. symmetric successive over relaxation method preconditioned conjugate gradient method converged 6% faster as maximum if the stress singular area was contained in one sub-domain.

Sign in / Sign up

Export Citation Format

Share Document