• Journal of Power Electronics
• /
• v.19 no.6
• /
• pp.1527-1535
• /
• 2019

Because of the shortcomings of the PID controllers and traditional drive systems of permanent magnet synchronous motors (PMSMs), a PMSM passivity-based control (PBC) drive system based on a quasi-Z source matrix converter (QZMC) is proposed in this paper. The traditional matrix converter is a buck converter with a maximum voltage transmission ratio of only 0.866, which limits the performance of the driven motor. Therefore, in this paper a quasi-Z source circuit is added to the input side of the two-stage matrix converter (TSMC) and its working principle has also been verified. In addition, the controller of the speed loop and current loop in the conventional vector control of a PMSM is a PID controller. The PID controller has the problem since its parameters are difficult to adjust and its anti-interference capability is limited. As a result, a port controlled dissipative Hamiltonian model (PCHD) of a PMSM is established. Thereafter a passivity-based controller based on the interconnection and damping assignment (IDA) of a QZMC-PMSM is designed, and the stability of the equilibrium point is theoretically verified. Simulation and experimental results show that the designed PBC control system of a PMSM based on a QZMC can make the PMSM run stably at the rated speed. In addition, the system has strong robustness, as well as good dynamic and static performances.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.4
• /
• pp.286-290
• /
• 2005

We consider the poisson equation where the functions involved are periodic including the solution function. Let $R=[0,1]{\times}[0,l]{\times}[0,1]$ be the region of interest and let $\phi$(x,y,z) be an arbitrary periodic function defined in the region R such that $\phi$(x,y,z) satisfies $\phi$(x+1, y, z)=$\phi$(x, y+1, z)=$\phi$(x, y, z+1)=$\phi$(x,y,z) for all x,y,z. We describe a very simple method for solving the equation ${\nabla}^2u(x, y, z)$ = $\phi$(x, y, z) based on the cubic spline interpolation of u(x, y, z); using the requirement that each interval [0,1] is a multiple of the period in the corresponding coordinates, the Laplacian operator applied to the cubic spline interpolation of u(x, y, z) can be replaced by a square matrix. The solution can then be computed simply by multiplying $\phi$(x, y, z) by the inverse of this matrix. A description on how the storage of nearly a Giga byte for $20{\times}20{\times}20$ nodes, equivalent to a $8000{\times}8000$ matrix is handled by using the fuzzy rule table method and a description on how the shape preserving property of the Laplacian operator will be affected by this approximation are included.

• Korean Journal of Mathematics
• /
• v.16 no.4
• /
• pp.481-494
• /
• 2008

Iteration functions $K_m(z)$ and $U_m(z)$, $m{\geq}2$are defined recursively using the determinant of a matrix. We show that the fixed-iterations of $K_m(z)$ and $U_m(z)$ converge to a simple zero with order of convergence m and give closed form expansions of $K_m(z)$ and $U_m(z)$: To show the convergence, we derive a recursion formula for $L_m$ and then apply the idea of Ford or Pomentale. We also find a Toeplitz matrix whose determinant is $L_m(z)/(f^{\prime})^m$, and then we adapt the well-known results of Gerlach and Kalantari et.al. to give closed form expansions.

• Journal of KSNVE
• /
• v.9 no.1
• /
• pp.103-112
• /
• 1999

A new modeling and analysis technique for one-dimensional distributed parameter systems is presented. First. discretized equations of motion in Laplace domain are derived by applying discretization methods for partial differential equations of a one-dimensional structure with respect to spatial coordinate. Secondly. the z and inverse z transformations are applied to the discretized equations of motion for obtaining a dynamic matrix for a uniform element. Four different discretization methods are tested with an example. Finally, taking infinite on the number of step for a uniform element leads to an exact dynamic matrix for the uniform element. A generalized modal analysis procedure for eigenvalue analysis and modal expansion is also presented. The resulting element dynamic matrix is tested with a numerical example. Another application example is provided to demonstrate the applicability of the proposed method.

• Journal of the Korean Mathematical Society
• /
• v.40 no.2
• /
• pp.241-250
• /
• 2003

Let (B, m$_{B}$, k) be a maximal commutative $textsc{k}$-subalgebra of M$_{m}$(k). Then, for some element z $\in$ Soc(B), a k-algebra R = B［X,Y］/I, where I ＝ (m$_{B}$X, m$_{B}$Y, X$^2$- z,Y$^2$- z, XY) will create an interesting maximal commutative $textsc{k}$-subalgebra of a matrix algebra which is neither a $C_1$-construction nor a $C_2$-construction. This construction will also be useful to embed a maximal commutative $textsc{k}$-subalgebra of matrix algebra to a maximal commutative $textsc{k}$-subalgebra of a larger size matrix algebra.gebra.a.

• Journal of applied mathematics & informatics
• /
• v.28 no.5_6
• /
• pp.1409-1418
• /
• 2010

In this paper, we present a preconditioned iterative method for solving linear systems Ax = b, where A is a Z-matrix. We give some comparison theorems to show that the rate of convergence of the new preconditioned iterative method is faster than the rate of convergence of the previous preconditioned iterative method. Finally, we give one numerical example to show that our results are true.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.505-513
• /
• 2009

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. But the most of fuzzy systems are difficult to make fuzzy inference rules in the case of MIMO system. The past days, We had proposed the MIMO fuzzy inference which had extended a Z. Cao's fuzzy inference to handle MIMO system. But many times and effort needed to determine the relation matrix elements of MIMO fuzzy inference by heuristic and trial and error method in order to improve inference performances. In this paper, we propose a MIMO fuzzy inference method with the learning ability witch is used a gradient descent method in order to improve the performances. Through the computer simulation studies for the inverse kinematics problem of 2-axis robot, we show that proposed inference method using a gradient descent method has good performances.

• Journal of international Conference on Electrical Machines and Systems
• /
• v.1 no.2
• /
• pp.46-52
• /
• 2012

This paper proposes a novel single-phase ac-ac converter topology based on the Z-source concept. The converter provides buck-boost function and plays the role of frequency changer. Compared to the traditional ac-dc-ac converter, it uses fewer devices, realizes direct ac-ac power conversion, and has a simpler circuit structure, so as to have higher efficiency and better circuit characteristics. Compared to the traditional matrix converter, it provides a wider voltage regulation range. The circuit topology, operating principle, control method and simulation results are given in this paper, and the rationality and feasibility is verified.

• Korean Journal of Mathematics
• /
• v.31 no.2
• /
• pp.145-152
• /
• 2023

Let $P(z):=\sum\limits^{n}_{j=0}A_jz^j$, A_j ∈ ℂ^m×m, 0 ≤ j ≤ n be a matrix polynomial of degree n, such that A_n ≥ A_n-1 ≥ . . . ≥ A₀ ≥ 0, A_n > 0. Then the eigenvalues of P(z) lie in the closed unit disk. This theorem proved by Dirr and Wimmer [IEEE Trans. Automat. Control 52(2007), 2151-2153] is infact a matrix extension of a famous and elegant result on the distribution of zeros of polynomials known as Eneström-Kakeya theorem. In this paper, we prove a more general result which inter alia includes the above result as a special case. We also prove an improvement of a result due to Lê, Du, Nguyên [Oper. Matrices, 13(2019), 937-954] besides a matrix extention of a result proved by Mohammad [Amer. Math. Monthly, vol.74, No.3, March 1967].

• Communications of the Korean Mathematical Society
• /
• v.10 no.1
• /
• pp.35-38
• /
• 1995

Let A be a symmetric positive definite Cartan matrix. As in [4], we denote by U the quantum group arising from A and $U_\lambda$ be the corresponding quantum group at a root of unity $\lambda$. In [4], Lusztig constructed irreducible highest weight $U_\lambda$-modules $L_\lambda(z)$ for $z \in Z^n$ and showed that $L_\lambda(z)$ is of finite dimension over C if and only if $z \in (Z^+)^n$.