• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.415-424
• /
• 2007

The generalized inverses have many important applications in the aspects of theoretic research and numerical computations and therefore they were studied by many authors. In this paper we get some necessary and sufficient conditions of the forward order law for {1}-inverse of multiple matrices products $A\;=\;A_1A_2{\cdots}A_n$ by using the maximal rank of generalized Schur complement.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2003년도 추계학술대회 및 정기총회
• /
• pp.191-194
• /
• 2003

As internet commerce grows, many company has begun to use a CF (Collaborative Filtering) as a Recommender System. To achieve an accuracy of CF, we need to obtain sufficient account of voting scores from customers. Moreover, those scores may not be consistent. To overcome this problem, we propose a new recommendation scheme using binary user-item matrix, which represents whether a user purchases a product instead of using the voting scores. Through the experiment regarding this new scheme, a better accuracy is demonstrated.

• Journal of applied mathematics & informatics
• /
• 제12권1_2호
• /
• pp.165-182
• /
• 2003

Toeplitz matrix method and the product Nystrom method are described for mixed Fredholm-Volterra singular integral equation of the second kind with Carleman Kernel and logarithmic kernel. The results are compared with the exact solution of the integral equation. The error of each method is calculated.

• 대한수학회보
• /
• 제43권2호
• /
• pp.343-352
• /
• 2006

A real matrix A is called a sign-central matrix if for, every matrix $\tilde{A}$ with the same sign pattern as A, the convex hull of columns of $\tilde{A}$ contains the zero vector. A sign-central matrix A is called a tight sign-central matrix if the Hadamard (entrywise) product of any two columns of A contains a negative component. A real vector x = $(x_1,{\ldots},x_n)^T$ is called stable if $\|x_1\|{\leq}\|x_2\|{\leq}{\cdots}{\leq}\|x_n\|$. A tight sign-central matrix is called a $tight^*$ sign-central matrix if each of its columns is stable. In this paper, for a matrix B, we characterize those matrices C such that [B, C] is tight ($tight^*$) sign-central. We also construct the matrix C with smallest number of columns among all matrices C such that [B, C] is $tight^*$ sign-central.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.807-810
• /
• 1998

This paper propose the method to produce GRM(Generalized Reed-Muller)expansion. The general method to obtain GRM expansion coefficient for p valued n variable is derivation of single variable transform matrix and expand it n times using Kronecker product. In this case the size of matrix increases depending on the augmentation of variables. In this paper we propose the simple algorithm to produce GRM coefficient using a single variable transform matrix.

• Journal of applied mathematics & informatics
• /
• 제34권1_2호
• /
• pp.95-106
• /
• 2016

In this paper, according to the classical LSQR algorithm forsolving least squares (LS) problem, an iterative method is proposed for finding the minimum-norm pure imaginary solution of the quaternionic least squares (QLS) problem. By means of real representation of quaternion matrix, the QLS's correspongding vector algorithm is rewrited back to the matrix-form algorthm without Kronecker product and long vectors. Finally, numerical examples are reported that show the favorable numerical properties of the method.

• 대한수학회지
• /
• 제55권2호
• /
• pp.327-342
• /
• 2018

In this paper, a homotopy continuation method for obtaining the unique Hermitian positive definite solution of the nonlinear matrix equation $X-{\sum_{i=1}^{m}}A^{\ast}_iX^{-p_i}A_i=I$ with $p_i$ > 1 is proposed, which does not depend on a good initial approximation to the solution of matrix equation.

• 대한전자공학회논문지
• /
• 제24권1호
• /
• pp.173-176
• /
• 1987

This paper presents a simple factorization of the Hadamard matrix which is used to develop a fast algorithm for the Hadamard transform. This matrix decomposition is of the kronecker products of identity matrices and successively lower order Hadamard matrices. This following shows how the Kronecker product can be mathematically defined and efficiently implemented using a factorization matrix methods.

• Journal of the Korean Statistical Society
• /
• 제25권3호
• /
• pp.393-406
• /
• 1996

We obtain the general moment of non-central Wishart distribu-tion, using the J-th moment of a matrix quadratic form and the 2J-th moment of the matrix normal distribution. As an example, the second moment and kurtosis of non-central Wishart distribution are also investigated.

• 분석과학
• /
• 제20권2호
• /
• pp.176-182
• /
• 2007

본 연구는 매트릭스형의 농약 활성물질을 포함하는 서방성 수분 인지제제 및 그의 제조방법에 관한 것이다. 산을 첨가한 커들란 용액에 망목구조를 가진 매트릭스가 형성되며 이 매트릭스에 열처리를 하게 되면 수용성이 없어진다. 본 매트릭스의 망목구조는 수분이 존재조건에서 열리며 건조조건에서는 다시 닫히게 된다. 그러므로 본 서방성 제형시스템에서는 수분이 있는 조건에서만 농약 활성물질이 제형에서 방출된다. 본 서방성 제제에 따른 구성을 이용하면 농약 활성물질의 효과 발현시기를 제어할 수 있고, 약해(藥害) 등의 발생을 경감시킬 수 있다.