• Journal of applied mathematics & informatics
• /
• 제28권3_4호
• /
• pp.687-696
• /
• 2010

In this paper, an algorithm for computing the sparse approximate inverse factor of matrix $A^{T}\;A$, where A is an $m\;{\times}\;n$ matrix with $m\;{\geq}\;n$ and rank(A) = n, is proposed. The computation of the inverse factor are done without computing the matrix $A^{T}\;A$. The computed sparse approximate inverse factor is applied as a preconditioner for solving normal equations in conjunction with the CGNR algorithm. Some numerical experiments on test matrices are presented to show the efficiency of the method. A comparison with some available methods is also included.

• Journal of Ship and Ocean Technology
• /
• 제7권3호
• /
• pp.56-65
• /
• 2003

The hull monitoring systems of container ships with four long-base gages give enough information for identifying the hull girder loads such as bending and torsional moments. But such a load-identification for container ships has not been known. In this paper, a load-identification method is suggested in terms of a linear matrix equation that the measured strain vector equals to the multiplication of the transformation matrix and the desired strain component vector. The equation is proved to be mathematically complete by the property of positive-definite determinant of the transformation matrix. The method is applied to a hull stress monitoring system for 8100TED container ship during sea trial, and the estimated external loads illustrate reasonable results in comparison with the pre-estimated results. This moment decomposition concept has also been tested in real operation conditions. The typical phenomena over the Suez Canal illustrated very suitable results comparing with the physical understandings. Henceforth, one can effectively use the proposed concept to monitor the hull girder loads such as bending and torsional moments.

• 대한산업공학회지
• /
• 제25권3호
• /
• pp.290-297
• /
• 1999

In interior point methods for linear programming, we must solve a linear system with a symmetric positive definite matrix at every iteration, and Cholesky factorization is generally used to solve it. Therefore, if Cholesky factorization is not done successfully, many iterations are needed to find the optimal solution or we can not find it. We studied methods for improving the numerical stability of Cholesky factorization and the accuracy of the solution of the linear system.

• 대한수학회보
• /
• 제52권2호
• /
• pp.627-647
• /
• 2015

In this paper, we construct the Schr$\ddot{o}$dinger-Weil representation of the Jacobi group associated with a positive definite symmetric real matrix of degree m and find covariant maps for the Schr$\ddot{o}$dinger-Weil representation.

• 대한수학회논문집
• /
• 제10권1호
• /
• pp.35-38
• /
• 1995

Let A be a symmetric positive definite Cartan matrix. As in [4], we denote by U the quantum group arising from A and $U_\lambda$ be the corresponding quantum group at a root of unity $\lambda$. In [4], Lusztig constructed irreducible highest weight $U_\lambda$-modules $L_\lambda(z)$ for $z \in Z^n$ and showed that $L_\lambda(z)$ is of finite dimension over C if and only if $z \in (Z^+)^n$.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 합동 추계학술대회 논문집 정보 및 제어부문
• /
• pp.76-79
• /
• 2001

This paper is concerned with a stability analysis of Madam Type fuzzy systems. It Introduces the canonical form of an unforced fuzzy system and its stability theorem suggested in the previous study. Then it gives new simplified stability conditions based on the Lyapunov function method. A common positive definite matrix in the stability conditions is searched by the LMI method.

• Journal of applied mathematics & informatics
• /
• 제9권1호
• /
• pp.125-133
• /
• 2002

Recently, Several inequalities Khatri-Rao Products of two four partitioned blocks positive definite real symmetry matrices are established by Liu in[Lin. Alg. Appl. 289(1999): 267-277]. We extend these results in two ways. First, the results are extended to two any partitioned blocks Hermitian matrices. Second, necessary and sufficient conditions under which these inequalities become equalities are presented.

• 응용통계연구
• /
• 제30권1호
• /
• pp.103-117
• /
• 2017

경시적 자료분석에서 공변량 효과를 추정할 때 반복 측정된 결과들의 상관성은 고려되어야 한다. 따라서 공분산 행렬을 모형화하는 것은 매우 중요하다. 그러나 공분산 행렬의 추정은 모수들의 수가 많고 추정된 공분산행렬이 양정치성을 만족해야 하므로 쉽지 않은 문제이다. 이러한 제한을 극복하기 위해, 공분산행렬의 모형화를 위한 여러가지 방법을 제안하였다: 자기회귀/이동평균/자기회귀-이동평균 구조를 각각 적용한 수정 콜레스키분해 (Pourahmadi, 1999), 이동평균 콜레스키분해 (Zhang과 Leng, 2012)와 자기회귀-이동평균 콜레스키 분해 (Lee 등, 2017) 이들 구조를 가지는 공분산 행렬의 특징을 비교연구하고자 한다. 이 세 가지 모형의 성능을 비교하기 위한 모의실험을 실시한다.

• 제어로봇시스템학회논문지
• /
• 제3권2호
• /
• pp.109-114
• /
• 1997

In this paper, we present an output feedback $H^\infty$controller design method and derive the sufficient condition of the bounded real lemma for linear systems with multiple delays in states. For state delayed systems, sufficient conditions for the existence $\kappa$-th order $H^\infty$controllers are given in terms of three linear matrix inequalities(LMIs). Furthermore, we show how to construct such controllers from the positive definite solutions of their LMIs and given an example to illustrate the validitiy of the proosed design procedure.

• Transactions on Control, Automation and Systems Engineering
• /
• 제1권2호
• /
• pp.106-112
• /
• 1999

This paper presents an H$\infty$ controller design method for linear systems with time-varying delayed states, inputs, and measurement outputs. Using a Lyapounov unctional , the stability for delay systems is discussed independently of time delays . And a sufficient condition for the existence of H$\infty$ controllers of n-th order is given in terms of three matrix inequalities. Based on the positive-definite solutions of their matrix inequalities, we briefly explain how to construct H$\infty$ construct H$\infty$ controller, which stabilizes time-delay systems independently of delays and guarantees an H$\infty$ norm bound.