• 한국추진공학회:학술대회논문집
• /
• 한국추진공학회 2012년도 제38회 춘계학술대회논문집
• /
• pp.364-366
• /
• 2012

로켓 엔진의 연소실 내 음향학적 거동과 음향 감쇠 효과를 정량화하기 위한 방법을 연구하였다. DMD(Dynamic mode Decomposition) 방법을 이용한 결과와 기존의 정량화 방법인 damping factor를 이용해 구한 음향 감쇠 효과의 경향성을 배플 분사기가 장착된 연소실내의 음향 감쇠 정도를 비교 분석하여 나타내었다. 비교 결과, 기존의 정량화 방법과 DMD 방법을 이용해 구한 음향 감쇠 정도의 경향성이 일치하는 것을 확인하였다.

• 한국CDE학회논문집
• /
• 제9권1호
• /
• pp.44-50
• /
• 2004

Mechanical parts are often grouped into part families based on the similarity of their shapes, to support efficient manufacturing process planning and design modification. The 2-part sequence papers present similarity assessment techniques to support part family classification for machined parts. These exploit the multiple feature decompositions obtained by the feature recognition method using convex decomposition. Convex decomposition provides a hierarchical volumetric representation of a part, organized in an outside-in hierarchy. It provides local accessibility directions, which supports abstract and qualitative similarity assessment. It is converted to a Form Feature Decomposition (FFD), which represents a part using form features intrinsic to the shape of the part. This supports abstract and qualitative similarity assessment using positive feature volumes. FFD is converted to Negative Feature Decomposition (NFD), which represents a part as a base component and negative machining features. This supports a detailed, quantitative similarity assessment technique that measures the similarity between machined parts and associated machining processes implied by two parts' NFDs. Features of the NFD are organized into branch groups to capture the NFD hierarchy and feature interrelations. Branch groups of two parts' NFDs are matched to obtain pairs, and then features within each pair of branch groups are compared, exploiting feature type, size, machining direction, and other information relevant to machining processes. This paper, the first one of the two companion papers, describes the similarity assessment methods using convex decomposition and FFD.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2000년도 춘계학술대회 논문집 전자세라믹스 센서 및 박막재료 반도체재료 일렉트렛트 및 응용기술
• /
• pp.121-125
• /
• 2000

An ozone condenser by a selective adsorption on the silica gel surface is constructed. Ozone density is evaluated by three methods; ultraviolet absorption, thermal decomposition and Q-mass analyzing methods. Thermal decomposition method is found to be available to the density evaluation from dilute to highly condensed ozone. The highest ozone density condensed by the adsorption method is evaluated to be 97 mol%.

• East Asian mathematical journal
• /
• 제39권1호
• /
• pp.75-85
• /
• 2023

In this paper, a non-overlapping rectangular domain decomposition method is presented in order to numerically solve two-dimensional telegraph equations. The method is unconditionally stable and efficient. Spectral radius of the iteration matrix and convergence rate of the method are provided theoretically and confirmed numerically by MATLAB. Numerical experiments of examples are compared with several methods.

• Korean Journal of Mathematics
• /
• 제31권4호
• /
• pp.419-431
• /
• 2023

In this paper, we propose an iterative method for a symmetric interior penalty Galerkin method for heterogeneous elliptic problems. The iterative method consists mainly of two parts based on a non-overlapping domain decomposition approach. One is an intermediate preconditioner constructed by understanding the properties of the discontinuous finite element functions and the other is a preconditioning related to the dual-primal finite element tearing and interconnecting (FETI-DP) methodology. Numerical results for the proposed method are presented, which demonstrate the performance of the iterative method in terms of various parameters associated with the elliptic model problem, the finite element discretization, and non-overlapping subdomain decomposition.

• 한국정밀공학회지
• /
• 제23권1호
• /
• pp.174-184
• /
• 2006

In order to fill the holes with complex shapes in the large polygon model, a new approach which is based on the implicit surface interpolation method combined with domain decomposition method is presented. In the present study, a surface is constructed by creating smooth implicit surface from the incomplete polygon model through which the surface should pass. In the method an implicit surface is defined by a radial basis function, a continuous scalar-valued function over the domain $R^3$ The generated surface is the set of all points at which this scalar function takes on the value zero and is created by placing zero-valued constraints at the vertices of the polygon model. In this paper the well-known domain decomposition method is used in order to treat the large polygon model. The global domain of interest is divided into smaller domains where the problem can be solved locally. LU decomposition method is used to solve a set of small local problems and their local solutions are combined together using the weighting coefficients to obtain a global solution. In order to show the validity of the present study, various hole fillings are carried out fur the large and complex polygon model of arbitrary topology.

• 전자공학회논문지
• /
• 제50권3호
• /
• pp.212-218
• /
• 2013

본 논문에서는 SAR (Synthetic Aperture Radar) 영상에 SVD (Singular Value Decomposition) - Pseudo Spectrum 알고리즘을 적용하고 그 성능을 기존 알고리즘과 비교한다. 이 논문의 목적은 SAR 영상의 해상도 및 목표물 분해능을 높이고자 하는 것이다. 본 논문에서는 신호 성분으로 이루어진 Hankel Matrix와 SVD (Singular Value Decomposition) 방법을 사용하여 잡음에 강인하고 sidelobe이 적으며 스펙트럼 추정에서 해상도를 높인 SVD-Pseudo Spectrum 방법을 제안하였다. 또한 분해될 목표물을 모델링하여 알고리즘의 성능을 분석하고 SVD-Pseudo Spectrum 방법이 기존의 퓨리에 변환 기반 방법과 고해상도 기술 기반의 MUSIC 방법보다 더 좋은 성능을 가짐을 보인다.

• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 1998년도 춘계학술대회논문집
• /
• pp.246-249
• /
• 1998

In the present study, domain decomposition 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 parallelized using the Parallel Virtual Machine(PVM) library on a workstation cluster connected on networks. A numerical example for a simple upsetting is calculated and the speed-up ratio with respect to various domain decompositions and number of processors. Comparing the results, it is concluded that the improvement of performance is obtained through the proposed method.

• Journal of applied mathematics & informatics
• /
• 제27권5_6호
• /
• pp.1343-1359
• /
• 2009

In this paper, we implement a relatively new analytical technique by combining the traditional variational iteration method and the decomposition method which is called as the variational decomposition method (VDM) for solving the sixth-order boundary value problems. The proposed technique is in fact the modification of variatioanal iteration method by coupling it with the so-called Adomian's polynomials. The analytical results of the equations have been obtained in terms of convergent series with easily computable components. Comparisons are made to verify the reliability and accuracy of the proposed algorithm. Several examples are given to check the efficiency of the proposed algorithm. We have also considered an example where the VDM is not reliable.

• Kyungpook Mathematical Journal
• /
• 제60권4호
• /
• pp.753-765
• /
• 2020

Smoking is one of the main causes of health problems and continues to be one of the world's most significant health challenges. In this paper, we use the multi-step Adomian decomposition method (MSADM) to obtain approximate analytical solutions for a mathematical fractional model of the evolution of the smoking habit. The proposed MSADM scheme is only a simple modification of the Adomian decomposition method (ADM), in which ADM is treated algorithmically with a sequence of small intervals (i.e. time step) for finding accurate approximate solutions to the corresponding problems. A comparative study between the new algorithm and the classical Runge-Kutta method is presented in the case of integer-order derivatives. The solutions obtained are also presented graphically. The results reveal that the method is effective and convenient for solving linear and nonlinear differential equations of fractional order.