• Communications of the Korean Mathematical Society
• /
• v.29 no.2
• /
• pp.263-267
• /
• 2014

We study the growth rate of $H^1$ Sobolev norm of the solutions to Gross-Neveu and Thirring equations. A well-known result is the double exponential rate. We show that the $H^1$ Sobolev norm grows at most an exponential rate exp($ct^2$).

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.4
• /
• pp.841-852
• /
• 2019

We establish the generalized Myers theorem for Finsler manifolds under integral Ricci curvature bound. More precisely, we show that the forward complete Finsler n-manifold whose part of Ricci curvature less than a positive constant is small in $L^p$-norm (for p > n/2) have bounded diameter and finite fundamental group.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.2
• /
• pp.170-177
• /
• 1998

In this paper, a unified solution of Hankel norm approximation problem is proposed by $\delta$-operator. To derive the main result, all-pass property is derived from the inner and co-inner property in the $\delta$-domain. The solution of all-pass becomes an optimal Hankel norm approximation problem in .delta.-domain through LLFT(Low Linear Fractional Transformation) inserting feedback term $\phi(\gamma)$, which is a free design parameter, to hold the error bound desired against the variance between the original model and the solution of Hankel norm approximation problem. The proposed solution does not only cover continuous and discrete ones depending on sampling interval but also plays a key role in robust control and model reduction problem. The verification of the proposed solution is exemplified via simulation for the zero-order Hankel norm approximation problem and the model reduction problem applied to a 16th order MIMO system.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.2
• /
• pp.269-277
• /
• 2008

This paper proposes a necessary and sufficient condition of convergence in the $L_2$-norm sense for a feedback-based iterative learning control (ILC) system including a multi-input multi-output (MIMO) linear time-invariant (LTI) plant. It is shown that the convergence conditions for a nominal plant and an uncertain plant are equal to the nominal performance condition and the robust performance condition in the feedback control theory, respectively. Moreover, no additional effort is required to design an iterative learning controller because the performance weighting matrix is used as an iterative learning controller. By proving that the least upper bound of the $L_2$-norm of the remaining tracking error is less than that of the initial tracking error, this paper shows that the iterative learning controller combined with the feedback controller is more effective to reduce the tracking error than only the feedback controller. The validity of the proposed method is verified through computer simulations.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.2 s.302
• /
• pp.151-160
• /
• 2005

In this paper, we propose a new fast motion estimation algorithm based on successive elimination algorithm (SEA) which can dramatically reduce heavy complexity of the variable block size motion estimation in H.264 encoder. The proposed method applies the conventional SEA in the hierarchical manner to the seven block modes. That is, the proposed algorithm can remove the unnecessary computation of SAD by means of the process that the previous minimum SAD is compared to a current SAD for each mode which is obtained by accumulating sum norms or SAD of $4\times4$ blocks. As a result, we have tighter bound in the inequality between SAD and sum norm than in the ordinary SEA. If the basic size of the block is smaller than $4\times4$, the bound will become tighter but it also causes to increase computational complexity, specifically addition operations for sum norm. Compared with fast full search algorithm of JM of H.264, our algorithm saves 60 to $70\%$ of computation on average for several image sequences.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.64-68
• /
• 1996

In this note, we propose the discrete model reduction method over disc-type analytic domains. We define Hankel singular value over the disc that is mapped by standard bilinear mapping. And GSPA(generalized singular perturbation approximation) and DT(direct truncation) are generalized to GSPA and DT over a disc. Furthermore we show that the reduced order model over a smaller domain has a smaller L$_{\infty}$ norm error bound..

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.20 no.2
• /
• pp.107-121
• /
• 2016

We analyze the complexity of the LLL algorithm, invented by Lenstra, Lenstra, and $Lov{\acute{a}}sz$ as a a well-known lattice reduction (LR) algorithm which is previously known as having the complexity of $O(N^4{\log}B)$ multiplications (or, $O(N^5({\log}B)^2)$ bit operations) for a lattice basis matrix $H({\in}{\mathbb{R}}^{M{\times}N})$ where B is the maximum value among the squared norm of columns of H. This implies that the complexity of the lattice reduction algorithm depends only on the matrix size and the lattice basis norm. However, the matrix structures (i.e., the correlation among the columns) of a given lattice matrix, which is usually measured by its condition number or determinant, can affect the computational complexity of the LR algorithm. In this paper, to see how the matrix structures can affect the LLL algorithm's complexity, we derive a more tight upper bound on the complexity of LLL algorithm in terms of the condition number and determinant of a given lattice matrix. We also analyze the complexities of the LLL updating/downdating schemes using the proposed upper bound.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.751-753
• /
• 1996

The $H_{2}$/$H_{\infty}$ robust controller is designed by using polynomial approach. This controller can minimise a $H_{2}$ norm of error under the fixed bound of $H_{\infty}$ norm of mixed sensitivity function by employing the Youla parameterization and using polynomial approach at the same time. It is easy to apply this controller to adaptive system.

• Journal of the Korean Mathematical Society
• /
• v.46 no.5
• /
• pp.967-977
• /
• 2009

There are three standard weight functions on a linear code viz. Hamming weight, Lee weight, and Euclidean weight. Euclidean weight function is useful in connection with the lattice constructions [2] where the minimum norm of vectors in the lattice is related to the minimum Euclidean weight of the code. In this paper, we obtain an upper bound over the number of parity check digits for Euclidean weight codes detecting and correcting burst errors.

• Journal of the Korean Society for Precision Engineering
• /
• v.27 no.12
• /
• pp.59-66
• /
• 2010

We developed a model-based controller for 6-DOF micropositioning of a precision stage using $H_{\infty}$ norm, For the design, a state-space system of the mathematical model of the stage is derived In developing the controller, weighting functions are effectively designed in consideration of upper bounds of the sensitivity of the control loop and control input. Step responses in open and closed loop control are provided to verify the micropositioning performance of the stage. By applying the developed controller we prove that the inverse of the weighting function forms the upper bound of the control loop. It is also found that the controller makes the same sensitivity shape with all the DOFs due to the use of $H_{\infty}$ norm. The developed controller is expected to be applied successfully for industrial use.