• Journal of Power Electronics
• /
• 제6권1호
• /
• pp.67-72
• /
• 2006

This paper introduces two different types of AC current control methods for an indirect vector controlled induction motor using a matrix converter. The proposed methods combine the advantages of matrix converters with the advantages of the indirect vector AC current control methods. The first proposed method explains the basic idea of the hysteresis current control method for matrix converters and shows its capability and stability in comparison to the conventional method usually used for VSI. With the aid of the special configuration of the matrix converter, we also propose another current method which is modified from the first one in order to reduce both current ripple and torque ripple. Simulation results have verified the feasibility and the effectiveness of the proposed methods.

• 응용통계연구
• /
• 제17권1호
• /
• pp.119-134
• /
• 2004

AHP기법에서는 의사결정 요소들의 중요도를 추정함에 있어 통상 쌍대비교행렬 그 자체에 고유벡터법 또는 대수최소제곱법을 적용한다. 본 연구에서는 왜대칭행렬의 고유분해를 통해 쌍대비교행렬을 조정한 후 조정된 쌍대비교행렬에 대해 고유벡터법 또는 대수최소제곱법을 적용하는 중요도 추정법을 제안한다. 그리고 이 추정법이 가지는 여러 가지 이점과 의미를 이론적 근거와 실제 사용 예를 통해 보이고자 한다. 본 연구결과는 불일치성이 높은 쌍대비교행렬이 주어진 경우 불일치성을 줄이는데 특히 유용하게 활용될 수 있을 것이다.

• Journal of applied mathematics & informatics
• /
• 제7권2호
• /
• pp.439-451
• /
• 2000

To compute derivatives using matrix vector multiplication method, new algorithms were introduced in [1.2]n By these algorithms, we reduced roundoff error in computing derivative using Chebyshev collocation methods (CCM). In this paper, some applications of these algorithms ar presented.

• 한국통신학회논문지
• /
• 제9권3호
• /
• pp.127-131
• /
• 1984

벡터-매트릭스 곱셈을 인코히어런트(incoherent)광원에 의해 빠른 속도로 대량의 정보를 처리할 수 있는 IOVMM(incoherent optical vector matrix multiplier)을 구성하고 실험결과와 이론치를 비교하였다. 입력 벡터 및 매트릭스의 원소들은 양의 실수로만 국한시키고 입력 벡터는 LED배열로 나타내었으며 매트릭스는 마스크상에 면적변조방식으로 부호화하였다. 이 두 곱셈의 결과는 렌즈계를 통하여 포토 다이오우드 배열로 검출하였으며 하나의 채널로 출력신호를 관찰하기 위하여 애널로그 멀티플렉스를 사용하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1989년도 하계종합학술대회 논문집
• /
• pp.189-194
• /
• 1989

The sparse vector method is more efficient than conventional sparse matrix method when solving sparse system. This paper considers the structural relation between factorized L and inverse of L and presents a new ordering algorithm for sparse vector method. The method is useful in enhancing the sparsity of the inverse of L while preserving the aparsity of matrix. The performance of algorithm is compared with conventional algorithms by means of several power system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권12호
• /
• pp.5860-5876
• /
• 2018

A single snapshot data can only provide limited amount of information so that the rank of covariance matrix is not full, which is not adopted to complete the parameter estimation directly using the traditional super-resolution method. Aiming at solving the problem, a joint time delay and angle estimation using matrix pencil method based on information reconstruction vector for orthogonal frequency division multiplexing (OFDM) signal is proposed. Firstly, according to the channel frequency response vector of each array element, the algorithm reconstructs the vector data with delay and angle parameter information from both frequency and space dimensions. Then the enhanced data matrix for the extended array element is constructed, and the parameter vector of time delay and angle is estimated by the two-dimensional matrix pencil (2D MP) algorithm. Finally, the joint estimation of two-dimensional parameters is accomplished by the parameter pairing. The algorithm does not need a pseudo-spectral peak search, and the location of the target can be determined only by a single receiver, which can reduce the overhead of the positioning system. The theoretical analysis and simulation results show that the estimation accuracy of the proposed method in a single snapshot and low signal-to-noise ratio environment is much higher than that of Root Multiple Signal Classification algorithm (Root-MUSIC), and this method also achieves the higher estimation performance and efficiency with lower complexity cost compared to the one-dimensional matrix pencil algorithm.

• 전자공학회논문지B
• /
• 제31B권3호
• /
• pp.91-102
• /
• 1994

For the analysis of textured image, it requires large storage space and computation time to calculate the matrix features such as SGLDM(Spatial Gray Level Dependence Matrix). NGLDM(Neighboring Gray Level Dependence Matrix). NSGLDM(Neighboring Spatial Gray Level Dependence Matrix) and GLRLM(Gray Level Run Length Matrix). In spite of a large amount of information that each matrix contains, a set of several correlated scalar features calculated from the matrix is not sufficient to approximate it. In this paper, we propose a new classifier for textured images based on these matrices in which the projected vectors of each matrix on the meaningful directions are used as features. In the proposed method, an unknown image is classified to the class of a known image that gives the maximum similarity between the projected model vector from the known image and the vector from the unknown image. In the experiment to classify images of agricultural products, the proposed method shows good performance as much as 85-95% of correct classification ratio.

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2015년도 전력전자학술대회 논문집
• /
• pp.383-384
• /
• 2015

This paper presents a new space vector modulation (SVM) method for indirect matrix converters (IMCs) to reduce commonmode voltage as well as minimize output current ripple in a high voltage transfer ratio. In the proposed SVM, the three-vector modulation scheme is used in the rectifier stage, while the nonzero state modulation technique, where the three nearest active vectors are selected to synthesize the desired output voltage, is applied to inverter stage to reduce the CMV. The proposed SVM method can significantly reduce the output current ripple and common-mode voltage of the IMC without any extra hardware. Simulated results are provided to demonstrate the effectiveness of the proposed SVM method.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제3권1호
• /
• pp.100-104
• /
• 2003

The SVDD(support vector data description) is one of the most well-known one-class support vector learning methods, in which one tries the strategy of utilizing balls defined on the kernel feature space in order to distinguish a set of normal data from all other possible abnormal objects. The major concern of this paper is to consider the problem of modifying the SVDD into the direction of utilizing ellipsoids instead of balls in order to enable better classification performance. After a brief review about the original SVDD method, this paper establishes a new method utilizing ellipsoids in feature space, and presents a solution in the form of SDP(semi-definite programming) which is an optimization problem based on linear matrix inequalities.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 1998년도 추계 학술대회논문집
• /
• pp.153-159
• /
• 1998

The Newton-Krylov method on the unstructured grid flow solver using the cell-centered spatial discretization oi compressible Euler equations is presented. This flow solver uses the reconstructed primitive variables to get the higher order solutions. To get the quadratic convergence of Newton method with this solver, the careful linearization of face flux is performed with the reconstructed flow variables. The GMRES method is used to solve large sparse matrix and to improve the performance ILU preconditioner is adopted and vectorized with level scheduling algorithm. To get the quadratic convergence with the higher order schemes and to reduce the memory storage. the matrix-free implementation and Barth's matrix-vector method are implemented and compared with the traditional matrix-vector method. The convergence and computing times are compared with each other.