• Journal of the Korean Mathematical Society
• /
• v.52 no.4
• /
• pp.781-795
• /
• 2015

Given a positive integer n, a ring R is said to be n-semi-Armendariz if whenever $f^n=0$ for a polynomial f in one indeterminate over R, then the product (possibly with repetitions) of any n coefficients of f is equal to zero. A ring R is said to be semi-Armendariz if R is n-semi-Armendariz for every positive integer n. Semi-Armendariz rings are a generalization of Armendariz rings. We characterize when certain important matrix rings are n-semi-Armendariz, generalizing some results of Jeon, Lee and Ryu from their paper (J. Korean Math. Soc. 47 (2010), 719-733), and we answer a problem left open in that paper.

• Journal of Power Electronics
• /
• v.19 no.5
• /
• pp.1142-1152
• /
• 2019

This paper presents a control method for reducing the current distortion in an indirect matrix converter (IMC) operating in boost mode under unbalanced input conditions. IMCs operating in boost mode are useful in distributed generation (DG) systems. They are connected with renewable energy systems (RESs) and the grid to transmit the power generated by the RES. However, under unbalanced voltage conditions of the RES, which is connected with the input stage of the IMC operating in boost mode, the input-output currents are distorted. In particular, the output current distortions cause a ripple of the power, which is transferred to the grid. This aggravates the reliability and stability of the DG system. Therefore, in this paper, a control method using positive/negative sequence voltages and currents is proposed for reducing the current distortion of both side in IMCs operating in boost mode. Simulation and experimental results have been presented to validate effectiveness of the proposed control method.

• Journal of the Korean Mathematical Society
• /
• v.55 no.1
• /
• pp.73-82
• /
• 2018

In this article we consider certain types of nonlinear matrix equations including the stochastic rational Riccati equation and show the existence and uniqueness of the positive definite solution by using Bhaskar-Lakshmikantham's coupled fixed point theorem.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.383-392
• /
• 1998

This paper proposes Generalized Stationary Iterative called GSI method. It is shown that the existing stationary iterative methods are special cases of GSI method. Convergence properties of this method are provided and their numerical experiments for linear systems with symmetric positive definite matrix are also provided.

• Journal of the Chungcheong Mathematical Society
• /
• v.30 no.1
• /
• pp.21-29
• /
• 2017

We review a partial trace alternatively defined by the composition of positive linear maps, and see how the partial trace acts on the matrix geometric means. We also study the quantum Tsallis relative entropy under partial trace related with the fidelity.

• Journal of Periodontal and Implant Science
• /
• v.37 no.1
• /
• pp.53-64
• /
• 2007

The aim of this study was to examine the possibility of periodontal ligament regeneration when autotransplantation was used by the periodontal ligament fibroblasts cultured on the acellular dermal matrix in teeth without a periodontal ligament. One minipig was used in this study. The mandibular and maxillary permanent incisors were ex-tracted for the culture of the periodontal ligament cells. The roots of the unextracted teeth were classified into a positive control group, in which the normal periodontal ligament was preserved. The roots of the extracted teeth were divided into the following two groups: The negative control group, in which the periodontal ligament had been removed and the acellular dermal matrix was not applied; and an experimental group, in which the periodontal ligament had been removed and periodontal ligament fibroblast cultured on an acellular dermal matrix was applied. The prepared teeth were transplanted, and completely submerged using physical barrier membranes. The animal was sacrificed 4 weeks after the autotransplant. The transplanted teeth were examined histologically. In this study, the periodontal ligament was normal in the positive control group, and ankylosis was discovered on the denuded root surface in the negative control group. Periodontal ligament-like connective tissue was found adjacent to the denuded root and the new cementum-like layer of hard tissue was formed in the experimental group. These results suggest that the periodontal ligament fibroblasts cultured on the acellular dermal matrix may play a role in regenerating the periodontal ligament-like tissue with new cememtum-like tissue formation.

• Communications of the Korean Mathematical Society
• /
• v.13 no.3
• /
• pp.465-473
• /
• 1998

A real m $\times$ n matrix A is semipositive (SP) if there is a vector x $\geq$ 0 such that Ax > 0, inequalities being entrywise. A is minimally semipositive (MSP) if A is semipositive and no column deleted submatrix of A is semipositive. We give a necessary and sufficient condition for the sign pattern matrix with n positive entries to be minimally semipositive.

• Bulletin of the Korean Mathematical Society
• /
• v.41 no.2
• /
• pp.199-211
• /
• 2004

For positive integers $\kappa$ and p$\geq$3, let(equation omitted) where $J_{p}$ is the p${\times}$p matrix whose entries are all 1. Then, we determine the minimum permanents and minimizing matrices over (1) the face of $\Omega$(D) and (2) the face of $\Omega$($D^{*}$), where (equation omitted).

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.455-458
• /
• 2003

An optimal control approach to robust control design is proposed in this study for rigid robotic systems under the unknown load and the other uncertainties. The uncertainties are quadratically bounded for some positive definite matrix. Iterative method to find the matrix is shown. Simulations arc made for a weight-lifting operation of a two-link manipulator and the robust control performance of robotic systems by the proposed algorithm is remarkable.

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