• Title/Summary/Keyword: decomposition method

Search Result 2,485, Processing Time 0.03 seconds

A Study on Quantification of Acoustic Amplification Using Dynamic Mode Decomposition Method (Dynamic Mode Decomposition 방법을 이용한 음향 증폭/감쇠 정량화에 관한 연구)

  • Jourdain, Guillaume;Eriksson, Lars-Erik;Kim, Su-Ho;Sohn, Chae-Hoon
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2012.05a
    • /
    • pp.364-366
    • /
    • 2012
  • Quantification of acoustic amplification in a model chamber has been studied for combustion stabilization induced by passive control devices. DMD(Dynamic mode Decomposition) method is adopted and the results from method are compared with those from damping factor approach. The model chamber has a faceplate with baffled injectors, where damping factor has its maximum at a specific baffle gap. They show a good agreement with the results from the previous method.

  • PDF

Part Similarity Assessment Method Based on Hierarchical Feature Decomposition: Part 1 - Using Convex Decomposition and Form Feature Decomposition (계층적 특징형상 정보에 기반한 부품 유사성 평가 방법: Part 1 - 볼록입체 분할방식 및 특징형상 분할방식 이용)

  • 김용세;강병구;정용희
    • Korean Journal of Computational Design and Engineering
    • /
    • v.9 no.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.

Ozone Condensation and Stable Supply by an Adsorption Method

  • Yang, Seong-Ho;Park, Yong-Pil;Lee, Joon-Ung
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2000.04b
    • /
    • 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%.

  • PDF

NON-OVERLAPPING RECTANGULAR DOMAIN DECOMPOSITION METHOD FOR TWO-DIMENSIONAL TELEGRAPH EQUATIONS

  • Younbae Jun
    • East Asian mathematical journal
    • /
    • v.39 no.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.

A NON-OVERLAPPING DOMAIN DECOMPOSITION METHOD FOR A DISCONTINUOUS GALERKIN METHOD: A NUMERICAL STUDY

  • Eun-Hee Park
    • Korean Journal of Mathematics
    • /
    • v.31 no.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.

A Study on Filling Holes of Large Polygon Model using Implicit Surface Scheme and Domain Decomposition Method (음함수 곡면기법과 영역 분할법을 이용한 대형 폴리곤 모델의 홀 메움에 관한 연구)

  • Yoo Dong-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.23 no.1 s.178
    • /
    • 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.

SAR Image Processing Using SVD-Pseudo Spectrum Technique (SAR에 적용된 SVD-Pseudo Spectrum 기술)

  • Kim, Binhee;Kong, Seung-Hyun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.3
    • /
    • pp.212-218
    • /
    • 2013
  • This paper presents an SVD(Singular Value Decomposition)-Pseudo Spectrum method for SAR (Synthetic Aperture Radar) imaging. The purpose of this work is to improve resolution and target separability of SAR images. This paper proposes SVD-Pseudo Spectrum method whose advantages are noise robustness, reduction of sidelobes and high resolution of spectral estimation. SVD-Pseudo Spectrum method uses Hankel Matrix of signal components and SVD (Singular Value Decomposition) method. In this paper, it is demonstrated that the SVD-Pseudo Spectrum method shows better performance than the matched filtering method and the conventional super-resolution based multiple signal classification (MUSIC) method in SAR image processing. The targets to be separated are modeled, and this modeled data is used to demonstrate the performance of algorithms.

Domain Decomposition using Substructuring Method and Parallel Comptation of the Rigid-Plastic Finite Element Analysis (부구조법에 의한 영역 분할 및 강소성 유한요소해석의 병렬 계산)

  • Park, Keun;Yang, Dong-Yol
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 1998.03a
    • /
    • 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.

  • PDF

VARIATIONAL DECOMPOSITION METHOD FOR SOLVING SIXTH-ORDER BOUNDARY VALUE PROBLEMS

  • Noor, Muhammad Aslam;Mohyud-Din, Syed Tauseef
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.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.

  • PDF

The Multi-step Adomian Decomposition Method for Approximating a Fractional Smoking Habit Model

  • Zuriqat, Mohammad;Freihat, Asad
    • Kyungpook Mathematical Journal
    • /
    • v.60 no.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.