• Kyungpook Mathematical Journal
• /
• 제49권4호
• /
• pp.595-603
• /
• 2009

We show that for an algebraic Riccati equation $X^*B^{-1}X-T^*X-X^*T=C$, its solutions are given by X = W + BT for some solution W of $X^*B^{-1}X$ = $C+T^*BT$. To generalize this, we give an equivalent condition for $\(\array{B&W\\W*&A}\)\;{\geq}\;0$ for given positive operators B and A, by which it can be regarded as Riccati inequality $X^*B^{-1}X{\leq}A$. As an application, the harmonic mean B ! C is explicitly written even if B and C are noninvertible.

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

This paper studies the problem of computing the Hankel singular values and vectors in the input delay systems. It is shown that the Hankel singular values are solutions to a transcendental equation and the Hankel singular vectors are obtained from the kernel of the matrix. The computation is carried out in state space framework. Finally, Hankel approximation of a simple example shows the usefulness of this study.

• 대한안전경영과학회지
• /
• 제13권1호
• /
• pp.133-142
• /
• 2011

Overhead facility design problem(OFDP) is one of the shortest rectilinear flow network problem(SRFNP)[4]. Genetic algorithm(GA), artificial immune system(AIS), population management genetic algorithm (PM) and greedy randomized adaptive search procedures (GRASP) were introduced to solve OFDP. A path matrix formed individual was designed to represent rectilinear path between each facility. An exchange crossover operator and an exchange mutation operator were introduced for OFDP. Computer programs for each algorithm were constructed to evaluate the performance of algorithms. Computation experiments were performed on the quality of solution and calculations time by using randomly generated test problems. The average object value of PM was the best of among four algorithms. The quality of solutions of AIS for the big sized problem were better than those of GA and GRASP. The solution quality of GRASP was the worst among four algorithms. Experimental results showed that the calculations time of GRASP was faster than any other algorithm. GA and PM had shown similar performance on calculation time and the calculation time of AIS was the worst.

• 마이크로전자및패키징학회지
• /
• 제29권1호
• /
• pp.67-70
• /
• 2022

본 연구는 최근 유행하고 있는 코로나 바이러스(SARS-CoV-2) UV 살균을 위한 1차원 광자 준결정 구조 개념의 광학 필터를 설계하고 시뮬레이션 하였다. 시뮬레이터는 수치해석 프로그램으로 사용되는 MATLAB 프로그램과 직접 코딩한 연산수식을 사용하였다. 비주기(복합구조) 다중층 구조 모델을 설계한 후, 특성 계산을 위하여 다중층 구조 모델의 물성치를 천이 행렬법(TMM, Transfer Matrix Method)으로 설정하였다. 설계된 복합 다중층 구조의 MATLAB을 활용한 전산모사법을 통하여 얻은 행렬값으로부터 반사도와 투과도를 계산하였다. 이 연구의 결과로 인체에 무해하면서 코로나 바이러스 UV 살균이 가능한 253.7 nm 파장만을 투과하는 광학 필터의 제작 및 응용 가능성을 증명하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.1452-1455
• /
• 1997

This paper studies the problem of approximating commensurate input delay sustems by finite dimensional systems based on the Hankel singular values. I is shown that the Gankel singular values are solutions a trancendental equation and the Hankel singular vectors are obtained form the kernel of the matrix. The computaioin is carried out in state spae framework. Once singular values and vectors are calcualted, finite dimensional approximated systems are constructed using stadnard linear system computational tools. An example is included.

• Journal of applied mathematics & informatics
• /
• 제8권2호
• /
• pp.371-386
• /
• 2001

In this work we investigate the finite element preconditioning method for the $C^1$-cubic spline collocation discretizations for an elliptic operator A defined by $Au := -{\Delta}u + a_1u_x+a_2u_y+a_0u$ in the unit square with some boundary conditions. We compute the condition number and the numerical solution of the preconditioning system for the several example problems. Finally, we compare the this preconditioning system with the another preconditioning system.

• 대한수학회보
• /
• 제39권2호
• /
• pp.283-287
• /
• 2002

In this paper, we will investigate the set of linear operators on real square matrices that strongly preserve multivariate majorisation without any additional conditions on the operator. This answers earlier conjecture on nonnegative matrices in [3] .

• 대한수학회지
• /
• 제40권6호
• /
• pp.943-950
• /
• 2003

The maximal column rank of an m by n matrix A over max algebra is the maximal number of the columns of A which are linearly independent. We compare the maximal column rank with rank of matrices over max algebra. We also characterize the linear operators which preserve the maximal column rank of matrices over max algebra.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.947-952
• /
• 1993

A simplified pole-placement design method is developed by analysing dynamic characteristics of the switching dynamics. Unlike the design procedure of conventional pole-placement, in the proposed method, overall state-space is directly decomposed into two invariant subspaces by the projection operator which is defined in the equivalent system, and then the closed-loop poles are assigned to each subspace independently. Hence, computations for state-feedback gain matrix are easy and simple.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
• /
• pp.427-430
• /
• 1989

For on-line ARMA spectral estimation, the fast transversal filter algorithm of extended least squares method(ETS FTF) is presented. The projection operator, a key tool for geometric approach, is used in the derivation of the algorithm. ELS FTF is a fast time update recursion which is based on the fact that the correlation matrix of ARMA model satisfies the shift invariance property in each block, and thus it takes 10N+31 MADPR.