• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.115-123
• /
• 1997

In this paper we present a polynomial matrix decomposition algorithm that determines a polynomial matix M(z) which satisfies the relation V(z)=M(z) for a given polynomial matrix V(z) which is paraconjugate hermitian matrix with normal rank r and is positive semidenfinite on the unit circle of z-plane. All the decomposition procedures in this proposed method are performed in the digitral domain. We also discuss how to apply the polynomial matirx decomposition in realizing MIMO LBR two-pairs.

• Kyungpook Mathematical Journal
• /
• v.50 no.4
• /
• pp.465-472
• /
• 2010

In this paper, we consider two extreme sets of zero-term rank sum of fuzzy matrix pairs: $$\cal{z}_1(\cal{F})=\{(X,Y){\in}\cal{M}_{m,n}(\cal{F})^2{\mid}z(X+Y)=min\{z(X),z(Y)\}\};$$ $$\cal{z}_2(\cal{F})=\{(X,Y){\in}\cal{M}_{m,n}(\cal{F})^2{\mid}z(X+Y)=0\}$$. We characterize the linear operators that preserve these two extreme sets of zero-term rank sum of fuzzy matrix pairs.

• Honam Mathematical Journal
• /
• v.21 no.1
• /
• pp.57-64
• /
• 1999

Let K be a algebraically closed field of characteristic 0 and G be abelian group $Z_2{\times}Z_2{\times}Z_2$ or $Z_2{\times}Z_4$. We find the conditions which the elements of the group ring KG are unit and idempotent respecting using the basic table matrix of G. We can see that if ${\alpha}={\sum}r(g)g$ is an idempotent element of KG, then $r(1)=0,\;\frac{1}{{\mid}G{\mid}},\;\frac{2}{{\mid}G{\mid}},\;{\cdots},\frac{{\mid}G{\mid}-1}{{\mid}G{\mid}},\;1$.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.193-196
• /
• 2008

Z. Cao had proposed NFRM(new fuzzy reasoning method) which infers in detail using relation matrix. In spite of the small inference rules, it shows good performance than mamdani's fuzzy inference method. In this paper, we propose 2. Cao's fuzzy inference method using learning ability witch is used a gradient descent method in order to improve the performances. Because it is difficult to determine the relation matrix elements by trial and error method which is needed many hours and effort. Simulation results are applied linear and nonlinear system show that the proposed inference method has good performances.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.9
• /
• pp.1591-1598
• /
• 2008

Z. Cao had proposed NFRM(new fuzzy reasoning method) which infers in detail using relation matrix. In spite of the small inference rules, it shows good performance than mamdani's fuzzy inference method. In this paper, we propose Z. Cao's fuzzy inference method with learning ability which is used a gradient descent method in order to improve the performances. It is hard to determine the relation matrix elements by trial and error method. Because this method is needed many hours and effort. Simulation results are applied nonlinear systems show that the proposed inference method using a gradient descent method has good performances.

• Communications of the Korean Mathematical Society
• /
• v.27 no.1
• /
• pp.207-215
• /
• 2012

In this paper, we provide comparison results of several types of the preconditioned Gauss-Seidel methods for solving a linear system whose coefficient matrix is a Z-matrix. Lastly, numerical results are presented to illustrate the theoretical results.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.15 no.1
• /
• pp.60-71
• /
• 2015

In this paper, a matrix game is considered in which the elements are represented as Z-numbers. The objective is to formalize the human capability for solving decision-making problems in uncertain situations. A ranking method of Z-numbers is proposed and used to define pure and mixed strategies. These strategies are then applied to find the optimal solution to the game problem with an induced pay off matrix using a min max, max min algorithm and the multi-section technique. Numerical examples are given in support of the proposed method.

• Journal of Power Electronics
• /
• v.9 no.2
• /
• pp.275-287
• /
• 2009

This paper investigates analytical models of Conduction and Switching Losses (CASLs) of a matrix-Z-source converter (MZC). Two analytical models of the CASLs are obtained through the examination of operating principles for a Z-source inverter and ac-dc matrix converter respectively. Based on the two models, the analytical model of CASLs for a MZC is constructed and visualized over a range of exemplified operating- points, each of which is defined by the combination of power factor (pt) and modulation index (M). The model provides a measurable way to approximate the total losses of the MZC.

• Communications of the Korean Mathematical Society
• /
• v.15 no.4
• /
• pp.597-603
• /
• 2000

Let K be an algebraically closed filed of characteristic 0 and let G = Z(sub)m x Z(sub)n. We find the conditions under which the elements of the group ring KG are units and idempotents respectively by using the represented matrix. We can see that if $\alpha$ = ∑r(g)g $\in$ KG is an idempotent then r(1) = 0, 1/mn, 2/mn, …, (mn-1)/mn or 1.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.1
• /
• pp.55-65
• /
• 1995

Existing multiple-row downdating algorithms have adopted a CFD(Cholesky Factor Downdating) that recursively downdates one row at a time. The CFD based algorithm requires 5/2p $n^{2}$ flops(floating point operations) downdating a p$\times$n observation matrix $Z^{T}$ . On the other hands, a HCFD(Hybrid CFD) based algorithm we propose in this paper, requires p $n^{2}$＋6/5 $n^{3}$ flops v hen p$\geq$n. Such a HCFD based algorithm factorizes $Z^{T}$ at first, such that $Z^{T}$ = $Q_{z}$ RT/Z, and then applies the CFD onto the upper triangular matrix Rt/z, so that the total number of floating point operations for downdating $Z^{T}$ would be significantly reduced compared with that of the CFD based algorithm. Benchmark tests on the Sun SPARC/2 and the Tolerant System also show that performance of the HCFD based algorithm is superior to that of the CFD based algorithm, especially when the number of rows of the observation matrix is large.rge.