• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.21 no.3
• /
• pp.125-142
• /
• 2017

In this paper, development of the three-dimensional structural analysis is performed by applying FETI-local method. In the FETI-local method, the penalty term is added as a preconditioner. The OPT-DKT shell element is used in the present structural analysis. Newmark-${\beta}$ method is employed to conduct the dynamic analysis. The three-dimensional FETI-local static structural analysis is conducted. The contour and the displacement of the results are compared following the different number of sub-domains. The computational time and memory usage are compared with respect to the number of CPUs used. The three-dimensional dynamic structural analysis is conducted while applying FETI-local method. The present results show appropriate scalability in terms of the computational time and memory usage. It is expected to improve the computational efficiency by combining the advantages of the original FETI method, i.e., FETI-mixed using the mixed local-global Lagrange multiplier.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.25 no.6
• /
• pp.469-476
• /
• 2012

In this paper, a finite element domain decomposition method using local and mixed Lagrange multipliers for a large scal structural analysis is presented. The proposed algorithms use local and mixed Lagrange multipliers to improve computational efficiency. In the original FETI method, classical Lagrange multiplier technique was used. In the dual-primal FETI method, the interface nodes are used at the corner nodes of each sub-domain. On the other hand, the proposed FETI-local analysis adopts localized Lagrange multipliers and the proposed FETI-mixed analysis uses both global and local Lagrange multipliers. The numerical analysis results by the proposed algorithms are compared with those obtained by dual-primal FETI method.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.35 no.5
• /
• pp.249-257
• /
• 2022

This paper presents an improved computational framework for the direct-solution-based finite element tearing and interconnecting (FETI) algorithm. The FETI-local algorithm is further improved herein, and localized Lagrange multipliers are used to define the interface among its subdomains. Selective inverse entry computation, using a property of the Boolean matrix, is employed for the computation of the subdomain interface stiffness and load, in which the original FETI-local algorithm requires a full matrix inverse computation of a high computational cost. In the global interface computation step, the original serial computation is replaced by a parallel multi-frontal method. The performance of the improved FETI-local algorithm was evaluated using a numerical example with 64 million degrees of freedom (DOFs). The computational time was reduced by up to 97.8% compared to that of the original algorithm. In addition, further stable and improved scalability was obtained in terms of a speed-up indicator. Furthermore, a performance comparison was conducted to evaluate the differences between the proposed algorithm and commercial software ANSYS using a large-scale computation with 432 million DOFs. Although ANSYS is superior in terms of computational time, the proposed algorithm has an advantage in terms of the speed-up increase per processor increase.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.24 no.2
• /
• pp.199-214
• /
• 2020

This paper describes the development of a parallel computational algorithm based on the finite element tearing and interconnecting (FETI) method that uses a local Lagrange multiplier. In this approach, structural computational domain is decomposed into non-overlapping sub-domains using local Lagrange multiplier. The local Lagrange multipliers are imposed at interconnecting nodes. 8-node solid element using extra shape function is adopted by using the representative volume element (RVE). The parallel computational algorithm is further established based on message passing interface (MPI). Finally, the present FETI-local approach is implemented on parallel hardware and shows improved performance.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.44 no.9
• /
• pp.775-780
• /
• 2016

In this paper, a computational algorithm of an improved and versatile structural analysis applicable for large-size flexible nonlinear structures is developed. In more detail, nonlinear finite element based on the co-rotational (CR) framework is developed. Then, a finite element tearing and interconnecting method using local Lagrange multipliers (FETI-local) is combined with the nonlinear CR finite element. The resulting computational algorithm is presented and applied for nonlinear static analyses, i.e., cantilevered beam and multibody structure. Finally, the proposed analysis is evaluated with regard to its parallel computation performance, and it is compared with those obtained by serial computation using the sparse matrix linear solver, PARDISO.

• International Journal of Aeronautical and Space Sciences
• /
• v.16 no.2
• /
• pp.177-189
• /
• 2015

This paper presents an all-direct domain decomposition approach for large-scale structural analysis. The proposed approach achieves computational robustness and efficiency by enforcing the compatibility of the displacement field across the sub-domain boundaries via local Lagrange multipliers and augmented Lagrangian formulation (ALF). The proposed domain decomposition approach was compared to the existing FETI approach in terms of the computational time and memory usage. The parallel implementation of the proposed algorithm was described in detail. Finally, a preliminary validation was attempted for the proposed approach, and the numerical results of two- and three-dimensional problems were compared to those obtained through a dual-primal FETI approach. The results indicate an improvement in the performance as a result of the implementing the proposed approach.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.18 no.1
• /
• pp.17-26
• /
• 2014

This paper presents development of an improved domain decomposition method for large scale structural problem that aims to provide high computational efficiency. In the previous researches, we developed the domain decomposition algorithm based on augmented Lagrangian formulation and proved numerical efficiency under both serial and parallel computing environment. In this paper, new computational analysis by the proposed domain decomposition method is performed. For this purpose, reduction in computational time achieved by the proposed algorithm is compared with that obtained by the dual-primal FETI method under serial computing condition. It is found that the proposed methods significantly accelerate the computational speed for a linear structural problem.