• 한국항공우주학회지
• /
• 제32권10호
• /
• pp.38-45
• /
• 2004

본 논문에서는 병렬 랜더링 기법의 특정들을 고창하고 이를 토대로 대규모 유한요소 해석결과를 효율적으로 가시화 할 수 있는 병렬 가시화 알고리듬을 제안하였다. 제안된 알고리듬은 요소영역별 계산을 기반으로 하는 병렬 유한요소 해석의 특성에 적합하도록 부분 후 분류방식을 기반으로 설계되었으며, 이미지 조합 과정에 수반되는 네트워크 통신을 효율화하고자 이진 트리구조 통신 패턴을 적용하여 구성되었다. 자체 개발된 소프트웨어를 이용하여 벤치마킹 테스트를 수행하고, 이를 통해 제안된 알고리듬의 병렬 가시화 성능을 측정하였다.

• 대한용접접합학회:학술대회논문집
• /
• 대한용접접합학회 2003년도 추계학술발표대회 개요집
• /
• pp.156-158
• /
• 2003

An implicit finite element implementation for Leblond's transformation plasticity constitutive equations, which are widely used in welded steel structure is proposed in the framework of parallel computing. The implementation is based upon the multiplicative decomposition of deformation gradient and hyper elastic formulation. We examine the efficiency of parallel computation for the finite element analysis of a welded structure using domain-wise multi-frontal solver.

• 대한용접접합학회:학술대회논문집
• /
• 대한용접접합학회 2002년도 춘계학술발표대회 개요집
• /
• pp.161-163
• /
• 2002

An implicit finite element implementation for Leblond's transformation plasticity constitutive equations, which are widely used in welded steel structure is proposed in the framework of parallel computing. The implementation is based upon the updated Lagrangian formulation. We examine the efficiency of parallel compuatation for the finite element analysis of a welded structure using multi-frontal solver.

• 한국전산구조공학회논문집
• /
• 제22권1호
• /
• pp.35-44
• /
• 2009

본 논문에서는 대규모 3차원 구조해석에 필요한 병렬 유한요소해석을 위한 영역분할법의 적용에 대해 묘사하였다. 영역분할법을 사용한 병렬 유한요소법 시스템을 개발하였다. 절점 생성시, 절점들간의 거리가 특정절점에서의 공간함수와 같아지면 절점이 생성되어 진다. 이 절점공간함수는 퍼지지식처리에 의해 조절되어 진다. 기본적인 요소생성은 데로우니 삼각화 기법을 적용하였다. 자동요소생성 시스템을 이용한 영역분할법은 3차원 해석에 큰 도움이 된다. 공간함수와 유사하게 절점들간의 유한요소해석을 위한 병렬 수치 알고리즘으로서 영역분할법을 전체의 해석영역을 완전히 여러 개의 작은 영역으로 겹치지 않게 나누는 공역구배인 반복적 솔버와 결합시켰다. 개발된 시스템의 효용성에 대한 성능을 몇 가지 예를 통해 제시하였다.

• 대한용접접합학회:학술대회논문집
• /
• 대한용접접합학회 2004년도 춘계 학술발표대회 개요집
• /
• pp.273-275
• /
• 2004

A parallel multi-frontal solver is developed for finite element analysis of an arc-welding process, which entails phase evolution, heat transfer, and deformations of structure. We verify the code via comparison to a commercial code,SYSWELD. Attention is focused on the implementation of the parallel solver using MPI library, on the speedup by parallel computation, and on the effectiveness of the solver in welding application

• 대한기계학회논문집A
• /
• 제24권5호
• /
• pp.1215-1230
• /
• 2000

Parallel Approaches using Cray T3E which is NIPP (Massively Parallel Processors) machine are presented for the efficient computation of the finite element analysis of 3-D shape rolling processes. D omain decomposition method coupled with parallel linear equation solver is used. Domain decomposition is applied for obtaining element tangent stifffiess matrices and residual vectors. Direct and iterative parallel algorithms are used for solving the linear equations. Direct algorithm is_parallel version of direct banded matrix solver. For iterative algorithms, the well-known preconditioned conjugate gradient solver with Jacobi preconditioner is also employed. Moreover a new effective iterative scheme with block inverse matrix preconditioner, which is named by present authors, is presented and its results are compared with the one using Jacobi preconditioner. PVM and MPI are used for message passing and synchronization between processors. The performance and efficiency of each algorithm is discussed and comparisons are made among different algorithms.

• International Journal of Aeronautical and Space Sciences
• /
• 제9권2호
• /
• pp.79-86
• /
• 2008

High performance direct-iterative hybrid linear solver for large scale finite element problem is developed. Direct solution method is robust but difficult to parallelize, whereas iterative solution method is opposite for direct method. Therefore, combining two solution methods is desired to get both high performance parallel efficiency and numerical robustness for large scale structural analysis problems. Hybrid method mentioned in this paper is based on FETI-DP (Finite Element Tearing and Interconnecting-Dual Primal method) which has good parallel scalability and efficiency. It is suitable for fourth and second order finite element elliptic problems including structural analysis problems. We are using the hybrid concept of theses two solution method categories, combining the multifrontal solver into FETI-DP based iterative solver. Hybrid solver is implemented for our general structural analysis code, IPSAP.

• 대한수학회지
• /
• 제53권6호
• /
• pp.1411-1429
• /
• 2016

We consider the nite volume element method for elliptic problems using isoparametric bilinear elements on quadrilateral meshes. A gradient recovery method is presented by using the patch interpolation technique. Based on some superclose estimates, we prove that the recovered gradient $R({\nabla}u_h)$ possesses the superconvergence: ${\parallel}{\nabla}u-R({\nabla}u_h){\parallel}=O(h^2){\parallel}u{\parallel}_3$. Finally, some numerical examples are provided to illustrate our theoretical analysis.

• 소성∙가공
• /
• 제7권5호
• /
• pp.474-480
• /
• 1998

In the present study a domain decomposition scheme using the substructuring method is developed for the computational efficiency of the finite element analysis of metal forming processes. in order to avoid calculation of an inverse matrix during the substructuring procedure, the modified Cholesky decomposition method is implemented. As obtaining the data independence by the substructuring method the program is easily paralleized using the Parallel Virtual machine(PVM) library on a work-station cluster connected on networks. A numerical example for a simple upsetting is calculated and the speed-up ratio with respect to various number of subdomains and number of processors. The efficiency of the parallel computation is discussed by comparing the results.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2000년도 추계 학술대회논문집
• /
• pp.1-8
• /
• 2000

In this work, Internet Supercomputing methodology is introduced and the concept is materialized for large-scale finite element analysis. The primary resources of Internet Supercomputing are numerous idling PCs connected by Internet with no regards to their locations. Therefore, it becomes one of the most affordable ways to achieve supercomputing power unlimitedly if the appropriate parallel algorithm and the operating program are developed for this slow network environment. Under the above concept, virtual supercomputing system InterSup I is constructed and tested. To establish the InterSup I system, 64 CPU nodes, which are located in several places and connected by Internet, are conscripted, and parallel finite element software is developed for linear static analysis of structures based on the parallel multi-frontal algorithm. By the established InterSup I system, analysis of finite element structural model having around five million DOFs are solved to check the affordability and effectiveness of Internet Supercomputing.