• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.229-234
• /
• 2015

In the setting of semidefinite linear complementarity problems on $S^n$, we focus on the Stein Transformation $S_A(X):=X-AXA^T$ for $A{\in}R^{n{\times}n}$ that is positive semidefinite preserving (i.e., $S_A(S^n_+){\subseteq}S^n_+$) and show that such transformation is strictly monotone if and only if it is nondegenerate. We also show that a positive semidefinite preserving $S_A$ has the Ultra-GUS property if and only if $1{\not\in}{\sigma}(A){\sigma}(A)$.

• Structural Engineering and Mechanics
• /
• v.62 no.3
• /
• pp.303-310
• /
• 2017

The model updating problems, which are to find the optimal approximation to the discrete quadratic model obtained by the finite element method, are critically important to the vibration analysis. In this paper, the structured model updating problem is considered, where the coefficient matrices are required to be symmetric and positive semidefinite, represent the interconnectivity of elements in the physical configuration and minimize the dynamics equations, and furthermore, due to the physical feasibility, the physical parameters should be positive. To the best of our knowledge, the model updating problem involving all these constraints has not been proposed in the existed literature. In this paper, based on the semidefinite programming technique, we design a general-purpose numerical algorithm for solving the structured model updating problems with incomplete measured data and present some numerical results to demonstrate the effectiveness of our method.

• Kyungpook Mathematical Journal
• /
• v.49 no.4
• /
• pp.743-750
• /
• 2009

A class of Hermitian operators B admitting a positive semidefinite solution of the linear operator equation ${\sum}^n_{j=1}A^{n-j}XA^{j-1}=B$ for a fixed positive definite operator A is given via the Furuta inequality.

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

• Communications of the Korean Mathematical Society
• /
• v.9 no.4
• /
• pp.767-772
• /
• 1994

For an $n \times n$ complex matrix $A = [A_{ij}]$, the permanent of A, per A, is defined by $$ per A = \sub_{\sigma \in S_n}{a_{1 \sigma(1)} a_{2 \sigma(2)} \cdots a_{n \sigma(n)} $$ where $S_n$ stands for the symmetric group on the set {1, 2, ..., n}.

• Kyungpook Mathematical Journal
• /
• v.57 no.4
• /
• pp.641-649
• /
• 2017

For partitioned matrices, the Khatri-Rao product is viewed as a generalized Hadamard product. In this paper we present Oppenheim's and Schur's determinantal inequalities for the Khatri-Rao product of two positive semidefinite matrices.

• Bulletin of the Korean Mathematical Society
• /
• v.37 no.3
• /
• pp.633-639
• /
• 2000

Let $A=(a_{ij}\ and\ B=(b_{ij}\ be\ n\times\ n$ complex matrices and let A$\bigcirc$B denote the Hadamard product of A and B, that is $AA\circB=(A_{ij{b_{ij})$.We conjecture a permanental analog of Oppenheim's inequality and verify it for n=2 and 3 as well as for some infinite classes of matrices.

• The Pure and Applied Mathematics
• /
• v.25 no.1
• /
• pp.39-48
• /
• 2018

In this work, by applying the binomial expansion, some refinements of the Young and Heinz inequalities are proved. As an application, a determinant inequality for positive definite matrices is obtained. Also, some operator inequalities around the Young's inequality for semidefinite invertible matrices are proved.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.3
• /
• pp.91-94
• /
• 1985

A method optimizing selection of a state weighting matrix is presented. The state weight-ing matrix is chosen so that the closed-loop system responses closely match to the ideal model responses. An algorithm is presented which determines a positive semidefinite state weighting matrix in the linear quadratic optimal control design problem and an numerical example is given to show the effect of the present algorithm.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.3
• /
• pp.609-616
• /
• 2021

We study the solvability of the Fermat's matrix equation in some classes of 2-by-2 matrices. We prove the Fermat's matrix equation has infinitely many solutions in a set of 2-by-2 positive semidefinite integral matrices, and has no nontrivial solutions in some classes including 2-by-2 symmetric rational matrices and stochastic quadratic field matrices.