• Bulletin of the Korean Mathematical Society
• /
• v.51 no.1
• /
• pp.237-252
• /
• 2014

In this paper, we give a necessary and sufficient condition for the hyponormality of the block Toeplitz operators $T_{\Phi}$, where ${\Phi}$ = $F+G^*$, F(z), G(z) are some matrix valued polynomials on the vector valued Bergman space $L^2_a(\mathbb{D},\mathbb{C}^n)$. We also show some necessary conditions for the hyponormality of $T_{F+G^*}$ with $F+G^*{\in}h^{\infty}{\otimes}M_{n{\times}n}$ on $L^2_a(\mathbb{D},\mathbb{C}^n)$.

• Kyungpook Mathematical Journal
• /
• v.49 no.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.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.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.

• Journal of the Korea Safety Management & Science
• /
• v.13 no.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.

• Journal of the Microelectronics and Packaging Society
• /
• v.29 no.1
• /
• pp.67-70
• /
• 2022

In the present work, we have designed to optimize the optical filter structures of the 1-dimensional photonic quasicrystals (1D PQCs) characteristic for the COVID-19 UV sterilization. The simulator using MATLAB program and ourselves manufacturing calculation codes. After making the aperiodic (and complexed) multi-layer structure model, we establish the transfer matrix method (TMM) for model by the operator conversion. By the using the MATLAB, we derive a matrix for the designed complexed multi-layer structure by applying the equations to the model by obtaining the reflectance and transmittance from the matrix. We also prove the possibility of application in optical filter for UV sterilization.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• 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
• /
• v.8 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.39 no.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] .

• Journal of the Korean Mathematical Society
• /
• v.40 no.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.10a
• /
• 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.