High scalable non-overlapping domain decomposition method using a direct method for finite element analysis
- Authors
- Tak, Moonho; Park, Taehyo
- Issue Date
- Sep-2013
- Publisher
- Elsevier BV
- Keywords
- FETI; Non-overlapping DDM; FEM; Parallel method
- Citation
- Computer Methods in Applied Mechanics and Engineering, v.264, pp 108 - 128
- Pages
- 21
- Indexed
- SCI
SCIE
SCOPUS
- Journal Title
- Computer Methods in Applied Mechanics and Engineering
- Volume
- 264
- Start Page
- 108
- End Page
- 128
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/162058
- DOI
- 10.1016/j.cma.2013.05.013
- ISSN
- 0045-7825
1879-2138
- Abstract
- In this paper, a novel domain decomposition method is introduced to solve a large finite element model. In this method, the decomposed domains do not overlap and are connected using a simple connective finite element, which influences the nodal point equilibrium between adjacent finite elements. This approach has the advantage that it allows use of a direct method such as Gauss elimination even in a singular problem. The singular stiffness matrices from the floating domain without the Dirichlet boundary conditions are changed into invertible stiffness matrices by assembling the connective elements. Another advantage is that computational time and storage can be reduced by using a banded matrix in the direct solver. In order to describe this proposed method, we first review the FETI method, which is the most popular domain decomposition method. Then the proposed method is introduced with a technical approach in a distributed computer system. Finally, the high scalability and computational efficiency of the proposed method are verified by comparing with the traditional FETI method for 2D and 3D finite element examples which have floating subdomains. In the result, we demonstrate high scalability for a large finite element model.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 건설환경공학과 > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.