• Journal of applied mathematics & informatics
• /
• 제32권5_6호
• /
• pp.747-760
• /
• 2014

In this paper a higher order iterative algorithm is developed for an unconstrained multivariate optimization problem. Taylor expansion of matrix valued function is used to prove the cubic order convergence of the proposed algorithm. The methodology is supported with numerical and graphical illustration.

• 대한수학회지
• /
• 제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.

• 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.

• 충청수학회지
• /
• 제24권4호
• /
• pp.895-903
• /
• 2011

A two dimensional version of LSQR iterative algorithm which takes advantages of working solely with the 2-dimensional arrays is developed and applied to the image deblurring problem. The efficiency of the method comparing to the Fourier-based LSQR method and the 2-D version CGLS algorithm methods proposed by Hanson ([4]) is analyzed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권4호
• /
• pp.1618-1637
• /
• 2018

By means of compressive sensing (CS) technique, this paper considers the collection of sensor data with spatiotemporal correlations in wireless sensor networks (WSNs). In energy-constrained WSNs, one-dimensional CS methods need a lot of data transmissions since they are less applicable in fully exploiting the spatiotemporal correlations, while the Kronecker CS (KCS) methods suffer performance degradations when the signal dimension increases. In this paper, an appropriate sensing matrix as well as an efficient sensing method is proposed to further reduce the data transmissions without the loss of the recovery performance. Different matrices for the temporal signal of each sensor node are separately designed. The corresponding energy-efficient data gathering method is presented, which only transmitting a subset of sensor readings to recover data of the entire WSN. Theoretical analysis indicates that the sensing structure could have the relatively small mutual coherence according to the selection of matrix. Compared with the existing spatiotemporal CS (CS-ST) method, the simulation results show that the proposed efficient measurement method could reduce data transmissions by about 25% with the similar recovery performance. In addition, compared with the conventional KCS method, for 95% successful recovery, the proposed sensing structure could improve the recovery performance by about 20%.

• 한국인터넷방송통신학회논문지
• /
• 제15권3호
• /
• pp.25-33
• /
• 2015

양면을 뒤집어 입을 수 있는 Jacket처럼, 내부 및 외부 양 쪽 모두 호환이 가능한 행렬을 Jacket 행렬이라 한다. element-wise inverse와 block-wise inverse 과정을 통해 Jacket 행렬은 안 쪽 요소와 바깥쪽 요소 모두를 가진다. 이 개념은 1989년에 저자 중 한 명인 이문호 교수에 의해 이루어진 것으로서, 2000년에는 최종적으로 Jacket 행렬이라 부르게 되었다. 이것은 잘 알려진 Hadamard 행렬의 가장 일반적인 확장으로서, 직교와 비직교 행렬에 대한 성질을 포함하고 있다. Jacket 행렬은 정보 및 통신 분야 이론의 많은 문제들을 해석하는데 이용된다. 본 논문에서는 Jacket 행렬의 성질과 특성, 예를 들어 determinants와 eigenvalues, Kronecker product에 대해서 다룬다. 이 연산들은 신호 처리와 직교 코드 디자인에 매우 유용하다. 또한, 본 논문은 복잡성이 낮은 매우 간단한 수학적 모델을 통해 이들의 유용성을 계산한 결과를 제시한다.

• 호남수학학술지
• /
• 제45권4호
• /
• pp.585-597
• /
• 2023

We introduce the rotational hypersurface x = x(u, v, s, t) constructed by double rotation in five dimensional Euclidean space 𝔼⁵. We reveal the first and the second fundamental form matrices, Gauss map, shape operator matrix of x. Additionally, defining the i-th curvatures of any hypersurface via Cayley-Hamilton theorem, we compute the curvatures of the rotational hypersurface x. We give some relations of the mean and Gauss-Kronecker curvatures of x. In addition, we reveal Δx=𝓐x, where 𝓐 is the 5 × 5 matrix in 𝔼⁵.

• 호남수학학술지
• /
• 제32권1호
• /
• pp.45-51
• /
• 2010

Let A be an abelian variety defined over a number field K and let L be a cyclic extension of K with Galois group G = <${\sigma}$> of order n. Let III(A/K) and III(A/L) denote, respectively, the Tate-Shafarevich groups of A over K and of A over L. Assume III(A/L) is finite. Let M(x) be a companion matrix of 1+x+${\cdots}$+$x^{n-1}$ and let $A^x$ be the twist of $A^{n-1}$ defined by $f^{-1}{\circ}f^{\sigma}$ = M(x) where $f:A^{n-1}{\rightarrow}A^x$ is an isomorphism defined over L. In this paper we compute [III(A/K)][III($A^x$/K)]/[III(A/L)] in terms of cohomology, where [X] is the order of an finite abelian group X.

• 대한수학회지
• /
• 제57권5호
• /
• pp.1187-1237
• /
• 2020

Simply reducible groups are important in physics and chemistry, which contain some of the important groups in condensed matter physics and crystal symmetry. By studying the group structures and irreducible representations, we find some new examples of simply reducible groups, namely, dihedral groups, some point groups, some dicyclic groups, generalized quaternion groups, Heisenberg groups over prime field of characteristic 2, some Clifford groups, and some Coxeter groups. We give the precise decompositions of product of irreducible characters of dihedral groups, Heisenberg groups, and some Coxeter groups, giving the Clebsch-Gordan coefficients for these groups. To verify some of our results, we use the computer algebra systems GAP and SAGE to construct and get the character tables of some examples.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 추계학술대회 논문집 학회본부 B
• /
• pp.485-487
• /
• 1999

We propose the algorithm with which one can solve the problem of the two-level hierarchical optimal control of nonlinear systems by repeatedly updating the state vectors using the haar function and Picard's iteration methods. Using the simple operation of the coefficient vectors from the fast haar transformation in the upper level and applying that vectors to Picard iteration methods in the independently lower level allow us to obtain the another method except the inversion matrix operation of the high dimention and the kronecker product in the optimal control algorithm.