• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.5
• /
• pp.475-482
• /
• 2010

In this paper, an efficient two-level parallel domain decomposition algorithm is suggested to solve large-DOF structural problems. Each subdomain is composed of the coarse problem and local problem. In the coarse problem, displacements at coarse nodes are computed by the iterative method that does not need to assemble a stiffness matrix for the whole coarse problem. Then displacements at local nodes are computed by Multi-Frontal Sparse Solver. A parallel version of PCG(Preconditioned Conjugate Gradient Method) is developed to solve the coarse problem iteratively, which minimizes the data communication amount between processors to increase the possible problem DOF size while maintaining the computational efficiency. The test results show that the suggested algorithm provides scalability on computing performance and an efficient approach to solve large-DOF structural problems.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.864-865
• /
• 2015

웹페이지와 같은 스크린 콘텐츠는 카메라로부터 획득할 수 있는 자연영상과 달리 텍스트, 로고, 아이콘 및 하위 영상과 같은 여러 가지 요소들을 포함하고 있고, 각 요소들은 서로 다른 형식의 정보를 사용자에게 전달한다. 본 논문에서는 윈도우 영상을 지역적인 특성에 따라 다수의 블록으로 분할한 후, 분할된 각 영역을 배경, 텍스트, 하위영상으로 분류하였고, 기계학습 기반의 알고리즘이 하위 영상 검출에도 좋은 접근법이 될 수 있음을 증명하기 위해 AdaBoost를 이용하였다. 실험결과로부터 93.4%의 검출률, 13%의 거짓 긍정률을 보임으로서, 제안방법이 효과적임을 입증하였다.

• Proceedings of the KIEE Conference
• /
• 2000.11b
• /
• pp.244-246
• /
• 2000

x,y평면 위를 자유롭게 구동할 수 있는 서피스 모터(평면 모터)의 디텐트력을 3차원 유한요소 해석을 이용하여 해석한다. 고정자와 이동자를 분리하여 모델링을 하고 접하는 면을 주기 경계조건으로 처리하여 실제로 이동하지 않고도 이동을 고려할 수 있도록 하였다. 고정자와 이동자의 계수 행렬을 분리하여 영역 분할법을 적용하여 계산 시간을 단축하였다.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.18 no.2
• /
• pp.133-140
• /
• 2005

A Plate on the elastic half-space may be generally be analyzed by the finite element method. However, there ate some difficulties to obtain the flexibility matrix of the foundation based on the Boussinesq's theory. In this study, an efficient numerical procedure which uses the analysis results of the vertical displacements due to the uniformly distributed loading in a circular area is presented. Some numerical examples represent better results than those of numerical integration technique or subsection method especially in the case of irregular mesh pattern.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.625-628
• /
• 1995

A static/implicit finite element code for sheet forming (ITAS3D) is parallelized on IBM SP 6000 multi-processor computer. Computing-load-balanced domain decomposition method and the direct solution method at each subdomain (and interface) equation are developed. The system of equations for each subdomain are constructed by condensation and calculated on each processor. Approximated operation counts are calculated to set up the nonlinear equation system for balancing the compute load on each subdomain. Th esquare cup tests with several numbers of elements are used in demonstrating the performance of this parallel implementation. This procedure are proved to be efficient for moderate number of processors, especially for large number of elements.

• 연구논문집
• /
• s.28
• /
• pp.123-135
• /
• 1998

A shape function for element free Galerkin method is carved from Shepard interpolant of singular weight and consistency condition. Thus present shape function is an interpolation and has no singularities. The shape function is applied to cantilever bending problems and gives good results in comparison with beam theory. Finally it is shown that the coupling with finite element method is made easily without any additional treaties.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.12
• /
• pp.889-898
• /
• 2022

In this paper, parallel computing method on the three-dimensional electromagnetic field is proposed. The present electromagnetic scattering analysis is conducted based on the time-harmonic vector wave equation and the finite element method. The edge-based element and 2^nd -order absorbing boundary condition are used. Parallelization of the elemental numerical integration and the matrix assemblage is accomplished by allocating the partitioned finite element subdomain for each processor. The graph partitioning library, METIS, is employed for the subdomain generation. The large sparse matrix computation is conducted by MUMPS, which is the parallel computing library based on the multi-frontal method. The accuracy of the present program is validated by the comparison against the Mie-series analytical solution and the results by ANSYS HFSS. In addition, the scalability is verified by measuring the speed-up in terms of the number of processors used. The present electromagnetic scattering analysis is performed for a perfect electric conductor sphere, isotropic/anisotropic dielectric sphere, and the missile configuration. The algorithm of the present program will be applied to the finite element and tearing method, aiming for the further extended parallel computing performance.

• Computational Structural Engineering
• /
• v.4 no.2
• /
• pp.77-85
• /
• 1991

A new finite element technology based on the p-version of E.F.M. is discussed with reference to its potential for application to stress intensity factor computations in linear elastic fracture mechanics, especially cracked cylindrical shells. It is shown that the p-version model is far better suited for computing the stress intensity factors than the conventional h-version models with the help of three test problems. The main advantage of this technology is that the accuracy of approximation can be established without mesh refinement or the use of special procedures such as crack-tip element and mixed variational approach.

• Journal of KIISE:Software and Applications
• /
• v.26 no.2
• /
• pp.273-283
• /
• 1999

래스터 지도에서 직선 또는 곡선과 중첩되어 있는 경우의 문자는 추출하기가 쉽지 않다. 따라서 본 논문에서는 고립되어 있는 문자뿐만 아니라 문자이외의 요소와 중첩되어 있는 문자도 효과적으로 추출할수 있는 분할 정복(divide and conquer) 개념에 기반한 문자 추출방법을 제시한다. 이를 위해 먼저 이미지의 연결 요소로부터 볼록다각형(convex hull)을 생성한다. 그리고 이 다각형이 충분한게 문자영역만을 포함할때가지 볼록 다각형을 이등분하면서 가장 긴 선분(투사 선분)을 기준으로 두 영역으로 분할한다. 다음으로 문자를 추출하기 위해서 이 선분을 기준으로 연결 요소상의 픽셀의 밀집도를 계산하는 알고리즘(프로파일링)을 적용한다. 또한 지도상에서 추출된 개별적인 문자들을 의미있는 단어들로 묶기(grouping)한 새로운 알고리즘을 소개한다. 특히 지도상에 나타나는 문자의 종류는 매우 다양하고 또한 이 문자들이 놓여있는 방향 역시 일정하지 않기 때문에 이러한 단어를 찾는 kd법은 쉽지 않다. 이를 위해 본 논문에서는 3차원 인접 그래프(3-D neighborhood graph)G를 소개한다. 이 그래프 G에서 각 노드는 하나의 분리된 문자를 나타내며 자신의 크기와 위치에 따라서 3차원 공간상에서 위치하게된다. 따라서, 크기가 큰 (작은)문자들은 보다 큰 (작은) z값을 가지고 되며 이 그래프 G에서 서로 인접한 노드들을 연결함으로써 지도상에 존재하는 서로 다른 종류의 문자 스트링을 추출할수 있다. 실험결과는 서로 다른 지도 이미지에 대해서 약 95% 이상의 단어 추출율을 보여준다.

• Journal of Radiation Protection and Research
• /
• v.17 no.1
• /
• pp.43-56
• /
• 1992

As one of the methods to ameliorate the ray effects which are the nature of anomalous computational effects due to the discretization of the angular variable in discrete ordinates approximations, a computational program, named TWODET (TWO dimensional Discrete Element Transport), has developed in 2 dimensional cartesian coordinates system using the discrete elements method, in which the discrete angle quadratures are steered by the spatially dependent angular fluxes. The results of the TWODET calculation with K-2, L-3 discrete angular quadratures, in the problem of a centrally located, isotropically emitting flat source in an absorbing square, are shown to be more accurate than that of the DOT 4.3 calculation with S-10 full symmetry angular quadratures, in remedy of the ray effect at the edge flux distributions of the square. But the computing time of the TWODET is about 4 times more than that of the DOT 4.3. In the problem of vacuum boundaries just outside of the source region in an absorbing square, the results of the TWODET calculation are shown severely anomalous ray effects, due to the sudden discontinuity between the source and the vacuum, like as the results of the DOT 4.3 calculation. In the probelm of an external source in an absorbing square in which a highly absorbing medium is added, the results of the TWODET calculation with K-3, L-4 show a good ones like as, somewhat more than, that of the DOT 4.3 calculation with S-10.