• 대한기계학회논문집
• /
• 제13권3호
• /
• pp.317-322
• /
• 1989

본 연구에서는 Liu의 매트릭스를 강소성 유한요소법에 도입하여 통상의 소성가공 공정중에 있는 피가공물의 3차원 변형을 실용적인 수준에서 해석 가능케 하는 강소성 유한요소법을 도입하여 통상의 소성가공 공정중에 있는 피가공물의 3차원 변형을 실용적인 수준에서 해석 가능케 하는 강소성 유한요소법을 제안하고 실례를 통하여 제안한수법에 의하여 얻어진 해의 안정성과 계산효율을 검토한다.

• 한국IT서비스학회지
• /
• 제9권4호
• /
• pp.219-229
• /
• 2010

The Green's equivalence relations have played a fundamental role in the development of semigroup theory. They are concerned with mutual divisibility of various kinds, and all of them reduce to the universal equivalence in a group. Boolean matrices have been successfully used in various areas, and many researches have been performed on them. Studying Green's relations on a monoid of boolean matrices will reveal important characteristics about boolean matrices, which may be useful in diverse applications. Although there are known algorithms that can compute Green relations, most of them are concerned with finding one equivalence class in a specific Green's relation and only a few algorithms have been appeared quite recently to deal with the problem of finding the whole D or J equivalence relations on the monoid of all $n{\times}n$ Boolean matrices. However, their results are far from satisfaction since their computational complexity is exponential-their computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices and the size of the monoid of all $n{\times}n$ Boolean matrices grows exponentially as n increases. As an effort to reduce the execution time, this paper shows an isomorphism between the R relation and L relation on the monoid of all $n{\times}n$ Boolean matrices in terms of transposition. introduces theorems based on it discusses an improved algorithm for the J relation computation whose design reflects those theorems and gives its execution results.

• 한국정보과학회논문지:시스템및이론
• /
• 제32권11_12호
• /
• pp.692-704
• /
• 2005

컴퓨터 하드웨어의 급속한 발전으로 그래픽 프로세서 유닛(Graphics Processor Units : GPUs)은 굉장한 메모리 대역폭과 산술 능역을 보유하게 되어 범용 계산에 많이 활용되고 있으며, 특히 계산 집약적인 물리 기반 시뮬레이션(physics based simulation)의 GPU 구현이 활발하게 연구되고 있다. 물리 기반 시뮬레이션의 기본이 되는 미분방정식 풀이 과정에서 삼중대각행렬(tridiagonal matrix) 시스템은 유한차분(finite-difference) 근사에 의해서 자주 나타나는 선형시스템으로 물리 기반 시뮬레이션 관점에서 삼중대각행렬 시스템의 빠른 풀이는 중요한 연구 분야이다. 본 논문에서는 GPU에서 삼중대각행렬 시스템 풀이를 빠르게 구현할 수 있는 방법을 제안한다. 벡터 프로세서(vector processor) 계산에서 삼중대각행렬 시스템 풀이 방법으로 널리 사용되는 cyclic reduction 또는 odd-even reduction 알고리즘을 GPU에서 구현하였다. 본 논문에서 제안한 방법을 삼중대각행렬 시스템 풀이 방법으로 잘 알려져 있는 Thomas 방법과 GPU를 이용한 선형시스템 풀이에서 좋은 성과를 보이고 있는 conjugate gradient 방법과 비교할 때 상당한 성능 향상을 얻을 수 있었다. 또한, 열전도(heat conduction) 방정식, 이류 확산(advection-diffusion) 방정식, 얕은 물(shallow water) 방정식에 의한 물리 기반 시뮬레이션의 GPU 구현에 본 논문에서 제안한 방법을 사용하여 1024x1024 격자의 계산 영역에서 초당 35프레임 이상의 놀라운 성능을 보여주었다.

• 제어로봇시스템학회논문지
• /
• 제14권10호
• /
• pp.977-982
• /
• 2008

In this paper Haar functions are developed to approximate the solutions of continuous time linear system. Properties of Haar functions are first presented, and an explicit expression for the inverse of the Haar operational matrix is presented. Using the inverse of the Haar operational matrix the full order Stein equation should be solved in terms of the solutions of pure algebraic matrix equations, which reduces the computation time remarkably. Finally a numerical example is illustrated to demonstrate the validity of the proposed algorithm.

• Communications for Statistical Applications and Methods
• /
• 제22권6호
• /
• pp.665-674
• /
• 2015

Lack of a general matrix formula hampers implementation of the semi-partial correlation, also known as part correlation, to the higher-order coefficient. This is because the higher-order semi-partial correlation calculation using a recursive formula requires an enormous number of recursive calculations to obtain the correlation coefficients. To resolve this difficulty, we derive a general matrix formula of the semi-partial correlation for fast computation. The semi-partial correlations are then implemented on an R package ppcor along with the partial correlation. Owing to the general matrix formulas, users can readily calculate the coefficients of both partial and semi-partial correlations without computational burden. The package ppcor further provides users with the level of the statistical significance with its test statistic.

• 대한조선학회지
• /
• 제24권3호
• /
• pp.1-8
• /
• 1987

In this paper, the localized finite element method(LFEM) is applied to 3-dimensional ship motion problems in water of infinite depth. The LFEM used here is based on the functional constructed by Bai & Yeung(1974). To test the present numerical scheme, a few vertical axisymmetric bodies are treated by general 3-dimensional formulation. The computed results of hydrodynamic coefficients for a few vertical spheroids and vertical circular cylinders show good agreement with results obtained by others. The advantages of the present numerical method compared with the method of integral equation are as follows; (i) The cumbersome existence of irregular frequencies in the method of conventional integral equation is removed. (ii) The final matrix is banded and symmetric and the computation of the matrix elements is comparatively easier, whereas the size of the matrix in the present scheme is much larger. (iii) In the future research, it is possible to accommodate with the nonlinear exact free surface boundary condition in the localized finite element subdomain, whereas the linear solution is assumed in the truncated(far field) subdomain.

• ETRI Journal
• /
• 제20권4호
• /
• pp.361-379
• /
• 1998

We present an improved transfer matrix algorithm which can be used in solving general n-band effective-mass $Schr{\ddot{o}}dinger$ equation for quantum well structures with arbitrary shaped potential profiles(where n specifies the number of bands explicitly included in the effective-mass equation). In the proposed algorithm, specific formulas are presented for the three-band (the conduction band and the two heavy- and light-hole bands) and two-band (the heavy- and light-hole bands) effective-mass eigensystems. Advantages of the present method can be taken in its simple and unified treatment for general $n{\times}n$ matrix envelope-function equations, which requires relatively smaller computation efforts as compared with existing methods of similar kind. As an illustration of application of the method, numerical computations are performed for a single GaAs/AlGaAs quantum well using both the two-band and three-band formulas. The results are compared with those obtained by the conventional variational procedure to assess the validity of the method.

• 제어로봇시스템학회논문지
• /
• 제4권4호
• /
• pp.413-419
• /
• 1998

A novel order-reduction technique for model predictive control(MPC) is proposed based on the singular value decomposition(SVD) of a pulse response circulant matrix(PRCM) of a concerned system. It is first investigated that the PRCM (in the limit) contains a complete information of the frequency response of a system and its SVD decomposes the information into the respective principal directions at each frequency. This enables us to isolate the significant modes of the system and to devise the proposed order-reduction technique. Though the primary purpose of the proposed technique is to diminish the required computation in MPC, the clear frequency decomposition of the SVD of the PRCM also enables us to improve the robustness through selective excitation of frequency modes. Performance of the proposed technique is illustrated through two numerical examples.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2005년도 춘계 학술대회논문집
• /
• pp.219-222
• /
• 2005

A compressible two-fluid two-phase flow computation model using the stiffened-gas equation of state is formulated. Since the conservation equation system is of mixed type, it gives complex eigenvalues. The sonic speeds obtained from the individual single phase have been simply used in the literature for the fastest wave speeds necessary in the HLL scheme. This method has worked fine but proved to be quite diffusive according to our test. To improve the accuracy, we here propose to utilize the analytic eigenvalues evaluated from an approximate Jacobian matrix lot the fastest wave speeds. The interfacial transfer terms were dropped in constituting the Jacobian matrix for this purpose. The present scheme proved efficient, robust and accurate in comparison with other existing methods. We solved the cavitating flow problem using the present scheme. The result shows more detailed wave structure in the cavitating process caused by the strong expansion waves.

• 대한수학회지
• /
• 제57권2호
• /
• pp.401-414
• /
• 2020

It is computationally expensive to compute principal components from scratch at every update or downdate when new data arrive and existing data are truncated from the data matrix frequently. To overcome this limitations, incremental principal component analysis is considered. Specifically, we present a sliding window based efficient incremental principal component computation from a covariance matrix which comprises of two procedures; simultaneous update and downdate of principal components, followed by the rank-one matrix update. Additionally we track the accurate decomposition error and the adaptive numerical rank. Experiments show that the proposed algorithm enables a faster execution speed and no-meaningful decomposition error differences compared to typical incremental principal component analysis algorithms, thereby maintaining a good approximation for the principal components.