• 한국CDE학회논문집
• /
• 제4권2호
• /
• pp.153-161
• /
• 1999

An atomatic mesh generation scheme with unstructured quadrilateral elements on trimmed surfaces has been developed. Trimmed surfaces are often encountered in modeling of structures with complex shapes such as aircrafts, automobile structures, pressure vessels and etc. For unstructured mesh generation with quadrilateral elements, a domain decomposition algorithm employing loop operators has been used. Mesh generation on trimmed surface is performed in three steps. First, trimmed surfaces with holes or cuts are transformed to th largest projection planes in which the meshes are constructed. The constructed meshes are transformed to the u-v parametric plane and then finally to the original 3D surfaces. Th exact locations of holes or cuts in projection planes are determined by the Newton-Raphson method. Sample meshes are constructed to demonstrate the effectiveness of the proposed algorithm.

• 한국전산유체공학회지
• /
• 제5권2호
• /
• pp.20-27
• /
• 2000

An unstructured implicit Euler solver is parallelized on a Cray T3E. Spatial discretization is accomplished by a cell-centered finite volume formulation using an upwind flux differencing. Time is advanced by the Gauss-Seidel implicit scheme. Domain decomposition is accomplished by using the k-way n-partitioning method developed by Karypis. In order to analyze the parallel performance of the solver, flows over a 2-D NACA 0012 airfoil and 3-D F-5 wing were investigated.

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

An unstructured implicit Euler solver is parallelized on a Cray T3E. Spatial discretization is accomplished by a cell-centered finite volume formulation using an unpwind flux differencing. Time is advanced by the Gauss-Seidel implicit scheme. Domain decomposition is accomplished by using the k-way N-partitioning method developed by Karypis. In order to analyze the parallel performance of the solver, flows over a 2-D NACA 0012 airfoil and a 3-D F-5 wing were investigated.

• 대한기계학회논문집A
• /
• 제24권7호
• /
• pp.1763-1770
• /
• 2000

A finite element interface system for the design of optimal spot welding locations has been developed. In order to find out the optimal locations of spot welding points, iterative finite element an alyses are necessary, and thus automatic generation of finite element model for the structures with spot welded pointsis required. In this interface system, quadrilateral shell elements are automatically generated for finite element analysis of spot welded structured, which employs a domain decomposition methodand adaptive mesh(h-method).

• Current Optics and Photonics
• /
• 제2권5호
• /
• pp.413-421
• /
• 2018

We propose a novel methodology based on the multiplication function to improve the signal-to-noise ratio (SNR) for vibration detection in a phi optical time-domain reflectometer system (phi-OTDR). The extreme-mean complementary empirical mode decomposition (ECEMD) is designed to break down the original signal into a set of inherent mode functions (IMFs). The multiplication function in terms of selected IMFs is used to determine a vibration's position. By this method, the SNR of a phi-OTDR system is enhanced by several orders of magnitude. Simulations and experiments applying the method to real data prove the validity of the proposed approach.

• 한국CDE학회논문집
• /
• 제8권4호
• /
• pp.270-277
• /
• 2003

In two dimensional mechanical design analysis, quadrilateral element mesh is preferred because it provides more accurate result than triangular element mesh. However, automation of quadrilateral element mesh generation is much more complex because of its geometrical complexities. In this study, an automatic quadrilateral element mesh generation algorithm based on the boundary normal offsetting method and the boundary decomposition method is developed. In so doing, nodes are automatically placed using the boundary normal offsetting method and the decomposition method is applied to decompose the designed domain into a set of convex subdomains. The generated elements are improved by relocation of the existing nodes based on the four criteria - uniformity, aspect ratio, skewness and taper degree. The developed algorithm requires minimal user inputs such as boundary data and the distance between nodes.

• 천문학회지
• /
• 제52권2호
• /
• pp.49-55
• /
• 2019

The New Vacuum Solar Telescope (NVST) is the largest solar telescope in China. When using CCDs for imaging, equal-thickness fringes caused by thin-film interference can occur. Such fringes reduce the quality of NVST data but cannot be removed using standard flat fielding. In this paper, a correction method based on multi-scale decomposition and adaptive partitioning is proposed. The original image is decomposed into several sub-scales by multi-scale decomposition. The region containing fringes is found and divided by an adaptive partitioning method. The interference fringes are then filtered by a frequency-domain Gaussian filter on every partitioned image. Our analysis shows that this method can effectively remove the interference fringes from a solar image while preserving useful information.

• 한국전산구조공학회논문집
• /
• 제23권4호
• /
• pp.369-378
• /
• 2010

포화된 다공질매체의 수치해석에서는 일반적으로 고체영역과 유체영역을 동시에 고려한 혼합유한요소해석(Mixed Finite Element Analysis)이 쓰인다. 여기서 고체영역과 유체영역에서의 변수를 계산하기 위해서는 직접법(Direct Method) 또는 반복법(Iterative method)을 사용할 수 있으나, 각 구성물질의 상이한 물리적 특성 때문에 수치안정성을 확보하기 위해서는 대부분 스태거드 방법(Staggered method)이 제안된다. 본 논문에서는 수치안정성을 높인 스태거드 방법에서 영역 분할기법 중 하나인 FETI(Finite Element Tearing and Interconnecting)기법을 고체영역에 접목시켜 수치효율성을 증대시키는 방법이 제안되었다. 고체영역에서 라그랑지 승수와 Conjugated Gradient Method를 이용해 영역 분할이 진행되고 MPI(Message Passing Interface) 라이브러리를 사용하여 수치 효율성을 검증하였다.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2014년도 춘계 종합학술대회 논문집
• /
• pp.403-404
• /
• 2014

• 유체기계공업학회:학술대회논문집
• /
• 유체기계공업학회 2006년 제4회 한국유체공학학술대회 논문집
• /
• pp.383-386
• /
• 2006

In this study, we propose a new fast algorithm for calculating short range forces in molecular dynamics, This algorithm uses a new hierarchical tree data structure which has a high adaptiveness to the particle distribution. It can divide a parent cell into k daughter cells and the tree structure is independent of the coordinate system and particle distribution. We investigated the characteristics and the performance of the tree structure according to k. For parallel computation, we used orthogonal recursive bisection method for domain decomposition to distribute particles to each processor, and the numerical experiments were performed on a 32-node Linux cluster. We compared the performance of the oct-tree and developed new algorithm according to the particle distributions, problem sizes and the number of processors. The comparison was performed sing tree-independent method and the results are independent of computing platform, parallelization, or programming language. It was found that the new algorithm can reduce computing cost for a large problem which has a short search range compared to the computational domain. But there are only small differences in wall-clock time because the proposed algorithm requires much time to construct tree structure than the oct-tree and he performance gain is small compared to the time for single time step calculation.