• Title/Summary/Keyword: matrix problems

Search Result 1,069, Processing Time 0.026 seconds

Volume Integral Equation Method for Multiple Anisotropic Inclusion Problems in an Infinite Solid under Uniaxial Tension (인장 하중을 받는 무한 고체에 포함된 다수의 이방성 함유체 문제 해석을 위한 체적 적분방정식법)

  • Lee, Jung-Ki
    • Composites Research
    • /
    • v.23 no.4
    • /
    • pp.7-13
    • /
    • 2010
  • A volume integral equation method (VIEM) is introduced for the solution of elastostatic problems in an unbounded isotropic elastic solids containing interacting multiple anisotropic inclusions subject to remote uniaxial tension. The method is applied to two-dimensional problems involving long parallel cylindrical inclusions. A detailed analysis of stress field at the interface between the matrix and the central inclusion is carried out for square and hexagonal packing of the inclusions. Effects of the number of anisotropic inclusions and various fiber volume fractions on the stress field at the interface between the matrix and the central inclusion are also investigated in detail. The accuracy of the method is validated by solving the single inclusion problem for which solutions are available in the literature.

A GENERALIZATION OF LOCAL SYMMETRIC AND SKEW-SYMMETRIC SPLITTING ITERATION METHODS FOR GENERALIZED SADDLE POINT PROBLEMS

  • Li, Jian-Lei;Luo, Dang;Zhang, Zhi-Jiang
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.5_6
    • /
    • pp.1167-1178
    • /
    • 2011
  • In this paper, we further investigate the local Hermitian and skew-Hermitian splitting (LHSS) iteration method and the modified LHSS (MLHSS) iteration method for solving generalized nonsymmetric saddle point problems with nonzero (2,2) blocks. When A is non-symmetric positive definite, the convergence conditions are obtained, which generalize some results of Jiang and Cao [M.-Q. Jiang and Y. Cao, On local Hermitian and Skew-Hermitian splitting iteration methods for generalized saddle point problems, J. Comput. Appl. Math., 2009(231): 973-982] for the generalized saddle point problems to generalized nonsymmetric saddle point problems with nonzero (2,2) blocks. Numerical experiments show the effectiveness of the iterative methods.

TRIZ-based Improvement of Glass Thermal Deformation in OLED Deposition Process (트리즈 기반 OLED 증착 공정의 글래스 열 변형 개선)

  • Lee, Woo-Sung;Choi, Jin Young
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.1
    • /
    • pp.114-123
    • /
    • 2017
  • The global small and mid-sized display market is changing from thin film transistor-liquid crystal display to organic light emitting diode (OLED). Reflecting these market conditions, the domestic and overseas display panel industry is making great effort to innovate OLED technology and incease productivity. However, current OLED production technology has not been able to satisfy the quality requirement levels by customers, as the market demand for OLED is becoming more and more diversified. In addition, as OLED panel production technology levels to satisfy customers' requirement become higher, product quality problems are persistently generated in OLED deposition process. These problems not only decrease the production yield but also cause a second problem of deteriorating productivity. Based on these observations, in this study, we suggest TRIZ-based improvement of defects caused by glass pixel position deformation, which is one of quality deterioration problems in small and medium OLED deposition process. Specifically, we derive various factors affecting the glass pixel position shift by using cause and effect diagram and identify radical reasons by using XY-matrix. As a result, it is confirmed that glass heat distortion due to the high temperature of the OLED deposition process is the most influential factor in the glass pixel position shift. In order to solve the identified factors, we analyzed the cause and mechanism of glass thermal deformation. We suggest an efficient method to minimize glass thermal deformation by applying the improvement plan of facilities using contradiction matrix in TRIZ. We show that the suggested method can decrease the glass temperature change by about 23% through an experiment.

Multichannel Blind Deconvolution of Multistage Structure to Eliminate Interference and Reverberation Signals (간섭 및 반향신호 제거를 위한 다단계 구조의 다채널 암묵 디콘볼루션)

  • Lim, Joung-Woo;Jeong, Gyu-Hyeok;Joo, Gi-Ho;Kim, Young-Ju;Lee, In-Sung
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.1
    • /
    • pp.85-93
    • /
    • 2007
  • In case that multichannel blind deconvolution (MBD) applies to signals of which autocorrelation has a high level, separated signals are temporally whitened by diagonal elements of a separation filter matrix. In order to reduce this distortion, the algorithms, which are based on either constraining diagonal elements of a separation filter matrix or estimating a separation filter matrix by using linear prediction residual signals, are presented. Still, some problems are generated in these methods, when we separate reverberation of signals themselves or interference signals from mixed signals. To solve these problems, this paper proposes the multichannel blind deconvolution method which divides processing procedure into the stage to separate interference signals and the stage to eliminate a reverberation of signals themselves. In simulation results, we confirm that the proposed algorithm can solve the problems.

MLFMA for Computation of TM Scattering from Near Resonant Object (유사 공진형 물체에 대한 TM 전자파의 산란계산을 위한 MLFMA방법)

  • ;W. C. Chew
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.9 no.6
    • /
    • pp.735-745
    • /
    • 1998
  • The method of moments has been widely used in the analysis of TM scattering problems. Recently, significant advances in the development of fast and efficient techniques for solving large problems have been reported. In such methods, iterative matrix solvers are preferred by virtue of their speed and low memory requirements. But for near resonant and strong multiple scattering problems, e.g., involving an aircraft engine inlet, a large number of iterations is required for convergence. In this paper, an efficient approximate inverse based preconditioner is used to reduce this number of iterations. By using the matrix partitioning method, the computational is used to reduce this number of iterations. By using the matrix partitioning method, the computational cost for obtaining the approximate inverse is reduced to O(N). We apply this preconditioner to an O(NlogN) algorithm, the multilevel fast multipole algorithm, for the aircraft engine inlet problem. The numerical results show the efficiency of this preconditioner.

  • PDF

Properties and Characteristics of Jacket Matrices (Jacket 행렬의 성질과 특성)

  • Yang, Jae-Seung;Park, Ju-Yong;Lee, Moon-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.3
    • /
    • pp.25-33
    • /
    • 2015
  • As a reversible Jacket is having the compatibility of two sided wearing, the matrix that both the inside and the outside are compatible is called Jacket matrix, and the matrix is having both inside and outside by the processes of element-wise inverse and block-wise inverse. This concept had been completed by one of the authors Moon Ho Lee in 1989, and finally that resultant matrix has been christened as Jacket matrix, in 2000. This is the most generalized extension of the well known Hadamard matrices, which includes both orthogonal and non-orthogonal matrices. This matrix addresses many problems in information and communication theories. we investigate the properties of the Jacket matrix, i.e. determinants, eigenvalues, and kronecker product. These computations are very useful for signal processing and orthogonal codes design. In our proposal, we provide some results to calculate these values by using a very simple mathematical model with less complexity.

Group Average-consensus and Group Formation-consensus for First-order Multi-agent Systems (일차 다개체 시스템의 그룹 평균 상태일치와 그룹 대형 상태일치)

  • Kim, Jae Man;Park, Jin Bae;Choi, Yoon Ho
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.20 no.12
    • /
    • pp.1225-1230
    • /
    • 2014
  • This paper investigates the group average-consensus and group formation-consensus problems for first-order multi-agent systems. The control protocol for group consensus is designed by considering the positive adjacency elements. Since each intra-group Laplacian matrix cannot be satisfied with the in-degree balance because of the positive adjacency elements between groups, we decompose the Laplacian matrix into an intra-group Laplacian matrix and an inter-group Laplacian matrix. Moreover, average matrices are used in the control protocol to analyze the stability of multi-agent systems with a fixed and undirected communication topology. Using the graph theory and the Lyapunov functional, stability analysis is performed for group average-consensus and group formation-consensus, respectively. Finally, some simulation results are presented to validate the effectiveness of the proposed control protocol for group consensus.

Efficient Use of Unused Spare Columns for Reducing Memory Miscorrections

  • Jung, Ji-Hun;Ishaq, Umair;Song, Jae-Hoon;Park, Sung-Ju
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.12 no.3
    • /
    • pp.331-340
    • /
    • 2012
  • In the deep sub-micron ICs, growing amounts of on-die memory and scaling effects make embedded memories increasingly vulnerable to reliability and yield problems. Spare columns are often included in memories to repair defective cells or bit lines during production test. In many cases, the repair process will not use all spare columns. Schemes have been proposed to exploit these unused spare columns to store additional check bits which can be used to reduce the miscorrection probability for triple errors in single error correction-double error detection (SEC-DED). These additional check bits increase the dimensions of the parity check matrix (H-matrix) requiring extra area overhead. A method is proposed in this paper to efficiently fill the extra rows of the H-matrix on the basis of similarity of logic between the other rows. Optimization of the whole H-matrix is accomplished through logic sharing within a feasible operating time resulting in reduced area overhead. A detailed implementation using fuse technology is also proposed in this paper.

An Extended AND-OR Graph-based Simulation and Electronic Commerce

  • Lee, Kun-Chang;Cho, Hyung-Rae
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1999.04a
    • /
    • pp.242-250
    • /
    • 1999
  • The objective of this paper is to propose an Extended AND-OR Graph (EAOG)-driven inferential simulation mechanism with which decision makers engaged in electronic commerce (EC) can effectively deal with complicated decision making problem. In the field of traditional expect systems research, AND-OR Graph approach cannot be effectively used in the EC problems in which real-time problem-solving property should be highly required. In this sense, we propose the EAOG inference mechanism for EC problem-solving in which heurisric knowledge necessary for intelligent EC problem-solving can be represented in a form of matrix. The EAOG method possesses the following three characteristics. 1. Realtime inference: The EAOG inference mechanism is suitable for the real-time inference because its computational mechanism is based on matrix computation.2. Matrix operation: All the subjective knowledge is delineated in a matrix form, so that inference process can proceed based on the matrix operation which is computationally efficient.3. Bi-directional inference: Traditional inference method of expert systems is based on either forward chaining or based on either and computational efficiency. However, the proposed EAOG inference mechanism is generically bi-directional without loss of both speed and efficiency.We have proved the validity of our approach with several propositions and an illustrative EC example.

  • PDF

Global Sliding Mode Control based on a Hyperbolic Tangent Function for Matrix Rectifier

  • Hu, Zhanhu;Hu, Wang;Wang, Zhiping;Mao, Yunshou;Hei, Chenyang
    • Journal of Power Electronics
    • /
    • v.17 no.4
    • /
    • pp.991-1003
    • /
    • 2017
  • The conventional sliding mode control (CSMC) has a number of problems. It may cause dc output voltage ripple and it cannot guarantee the robustness of the whole system for a matrix rectifier (MR). Furthermore, the existence of a filter can decrease the input power factor (IPF). Therefore, a novel global sliding mode control (GSMC) based on a hyperbolic tangent function with IPF compensation for MRs is proposed in this paper. Firstly, due to the reachability and existence of the sliding mode, the condition of the matrix rectifier's robustness and chattering elimination is derived. Secondly, a global switching function is designed and the determination of the transient operation status is given. Then a SMC compensation strategy based on a DQ transformation model is applied to compensate the decreasing IPF. Finally, simulations and experiments are carried out to verify the correctness and effectiveness of the control algorithm. The obtained results show that compared with CSMC, applying the proposed GSMC based on a hyperbolic tangent function for matrix rectifiers can achieve a ripple-free output voltage with a unity IPF. In addition, the rectifier has an excellent robust performance at all times.