• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.421-431
• /
• 2006

In this paper, we establish a matrix inequality and its equivalent form. Applying the results, some matrix inequalities involving Khatri-Rao products of positive semi-definite matrices are generalized.

• Journal of applied mathematics & informatics
• /
• v.10 no.1_2
• /
• pp.101-109
• /
• 2002

We extend two inequalities involving Hadamard Products of Positive definite Hermitian matrices to positive semi-definite Hermitian matrices. Simultaneously, we also show the sufficient conditions for equalities to hold. Moreover, some other matrix inequalities are also obtained. Our results and methods we different from those which are obtained by S. Liu in [J. Math. Anal. Appl. 243:458-463(2000)] and B.-Y Wang et al in [Lin. Alg. Appl. 302-303: 163-172(1999)] .

• Korean Journal of Mathematics
• /
• v.16 no.4
• /
• pp.565-571
• /
• 2008

In this paper we present some trace inequalities for positive definite matrices in statistical mechanics. In order to prove the method of the uniform bound on the generating functional for the semi-classical model, we use some trace inequalities and matrix norms and properties of trace for positive definite matrices.

• Communications of the Korean Mathematical Society
• /
• v.35 no.3
• /
• pp.917-925
• /
• 2020

It has been shown that the geometric mean A#B of positive definite Hermitian matrices A and B is the maximal element X of Hermitian matrices such that $$\(\array{A&X\\X&B}\)$$ is positive semi-definite. As an extension of this result for the 2 × 2 block matrix, we consider in this article the block matrix [[A#w_ijB]] whose (i, j) block is given by the Riemannian geodesics of positive definite Hermitian matrices A and B, where w_ij ∈ ℝ for all 1 ≤ i, j ≤ m. Under certain assumption of the Loewner order for A and B, we establish the equivalent condition for the parameter matrix ω = [w_ij] such that the block matrix [[A#w_ijB]] is positive semi-definite.

• Journal of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.669-677
• /
• 1996

Let $M_n$ be the $C^*$-algebra of all $n \times n$ matrices over the complex field, and $P[M_m, M_n]$ the convex cone of all positive linear maps from $M_m$ into $M_n$ that is, the maps which send the set of positive semidefinite matrices in $M_m$ into the set of positive semi-definite matrices in $M_n$. The convex structures of $P[M_m, M_n]$ are highly complicated even in low dimensions, and several authors [CL, KK, LW, O, R, S, W]have considered the possibility of decomposition of $P[M_m, M_n] into subcones.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.5
• /
• pp.1181-1199
• /
• 2023

For solving complex symmetric positive definite linear systems, we propose a single step real-valued (SSR) iterative method, which does not involve the complex arithmetic. The upper bound on the spectral radius of the iteration matrix of the SSR method is given and its convergence properties are analyzed. In addition, the quasi-optimal parameter which minimizes the upper bound for the spectral radius of the proposed method is computed. Finally, numerical experiments are given to demonstrate the effectiveness and robustness of the propose methods.

• Communications of the Korean Mathematical Society
• /
• v.9 no.3
• /
• pp.753-765
• /
• 1994

The linearly constrained quadratic programming(QP) considered is : $$ min f(x) = c^T x + \frac{1}{2}x^T Hx $$ $$ (1) subject to A^T x \geq b,$$ where $c,x \in R^n, b \in R^m, H \in R^{n \times n)}$, symmetric, and $A \in R^{n \times n}$. If there are bounds on x, these are included in the matrix $A^T$. The Hessian matrix H may be positive definite or negative semi-difinite. For large problems H and the constraint matrix A are assumed to be sparse.

• Journal of the Korean Mathematical Society
• /
• v.52 no.5
• /
• pp.1003-1021
• /
• 2015

A matrix completion problem has been exploited amply because of its abundant applications and the analysis of contractions enables us to have insight into structure and space of operators. In this article, we focus on a specific completion problem related to Hankel partial contractions. We provide concrete necessary and sufficient conditions for the existence of completion of Hankel partial contractions for both extremal and non-extremal types with lower dimensional matrices. Moreover, we give a negative answer for the conjecture presented in [8]. For our results, we use several tools such as the Nested Determinants Test (or Choleski's Algorithm), the Moore-Penrose inverse, the Schur product techniques, and a congruence of two positive semi-definite matrices; all these suggest an algorithmic approach to solve the contractive completion problem for general Hankel matrices of size $n{\times}n$ in both types.

• Communications for Statistical Applications and Methods
• /
• v.15 no.3
• /
• pp.333-342
• /
• 2008

Variable selection theorem in the linear regression model is extended to the analysis of covariance model. When some of regression variables are omitted from the model, it reduces the variance of the estimators but introduces bias. Thus an appropriate balance between a biased model and one with large variances is recommended.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.1
• /
• pp.20-27
• /
• 2020

In general, a nonlinear system is linearized in the form of a multiplication of the 1st and 2nd order system. This paper reports a design method of a weighting matrix and control law of LQ control to move the double poles that have a Jordan block to a pair of complex conjugate poles. This method has the advantages of pole placement and the guarantee of stability, but this method cannot position the poles correctly, and the matrix is chosen using a trial and error method. Therefore, a relation function (𝜌, 𝜃) between the poles and the matrix was derived under the condition that the poles are the roots of the characteristic equation of the Hamiltonian system. In addition, the Pole's Moving-range was obtained under the condition that the state weighting matrix becomes a positive semi-definite matrix. This paper presents examples of how the matrix and control law is calculated.