• Title/Summary/Keyword: normal matrix

Search Result 788, Processing Time 0.022 seconds

A Combustion Instability Analysis of a Model Gas Turbine Combustor by the Transfer Matrix Method

  • Cha, Dong-Jin;Kim, Jay-H.;Joo, Yong-Jin
    • Proceedings of the KSME Conference
    • /
    • 2008.11b
    • /
    • pp.2946-2951
    • /
    • 2008
  • Combustion instability is a major issue in design of gas turbine combustors for efficient operation with low emissions. Combustion instability is induced by the interaction of the unsteady heat release of the combustion process and the change in the acoustic pressure in the combustion chamber. In an effort to develop a technique to predict self-excited combustion instability of gas turbine combustors, a new stability analysis method based on the transfer matrix method is developed. The method views the combustion system as a one-dimensional acoustic system with a side branch and describes the heat source as the input to the system. This approach makes it possible to use the advantages of not only the transfer matrix method but also well-established classic control theories. The approach is applied to a simple gas turbine combustion system to demonstrate the validity and effectiveness of the approach.

  • PDF

NMMP1, a Matrix Metalloprotease in Nicotiana benthamiana Has a Role in Protection against Bacterial Infection

  • Kang, So-Ra;Oh, Sang-Keun;Kim, Jong-Joo;Choi, Do-Il;Baek, Kwang-Hyun
    • The Plant Pathology Journal
    • /
    • v.26 no.4
    • /
    • pp.402-408
    • /
    • 2010
  • Plant matrix metalloproteases (MMPs) are a family of apoplastic metalloproteases closely related to human matrilysins. Up-regulation of Nicotiana benthamiana matrix metalloprotease 1 (NMMP1) expression by treatment with pathogens, ethephon and aging indicates that the gene is related to plant defense and the aging process through ethylene signaling. NMMP1 expression was higher than in normal growth leaves following infection with an incompatible pathogen Pseudomonas syringae pv. tomato T1 or a compatible pathogen P. syringae pv. tabaci and in aged leaves. Transient overexpression of NMMP1 in N. benthamiana leaves lowered the growth of P. syringae pv. tabaci. However, NMMP1-silenced leaves showed increased growth of P. syringae pv. tabaci. These data strongly suggest that NMMP1 in N. benthamiana is a defense related gene, which is positively regulated by ethylene.

Strongly Clean Matrices Over Power Series

  • Chen, Huanyin;Kose, Handan;Kurtulmaz, Yosum
    • Kyungpook Mathematical Journal
    • /
    • v.56 no.2
    • /
    • pp.387-396
    • /
    • 2016
  • An $n{\times}n$ matrix A over a commutative ring is strongly clean provided that it can be written as the sum of an idempotent matrix and an invertible matrix that commute. Let R be an arbitrary commutative ring, and let $A(x){\in}M_n(R[[x]])$. We prove, in this note, that $A(x){\in}M_n(R[[x]])$ is strongly clean if and only if $A(0){\in}M_n(R)$ is strongly clean. Strongly clean matrices over quotient rings of power series are also determined.

A Fault Tolerant Strategy Based on Model Predictive Control for Full Bidirectional Switches Indirect Matrix Converter

  • Le, Van-Tien;Lee, Hong-Hee
    • Proceedings of the KIPE Conference
    • /
    • 2019.07a
    • /
    • pp.74-76
    • /
    • 2019
  • This paper proposes an open-switch fault tolerant strategy based on the model predictive control for a full bidirectional switches indirect matrix converter (FBS-IMC). Compared to the conventional Indirect Matrix Converter (IMC), the FBS-IMC can provide healthy current path when open-switch fault is occurred. To keep the continuous operation, the fault tolerant strategy is developed by means of reversing the DC-link voltage polarity regardless of the faulty switch location in the rectifier or inverter stage. Therefore, the proposed control strategy can maintain the same input and output performances during the faulty condition as the normal condition. The simulation results are given to verify the effectiveness of the proposed strategy.

  • PDF

ON WIELANDT-MIRSKY'S CONJECTURE FOR MATRIX POLYNOMIALS

  • Le, Cong-Trinh
    • Bulletin of the Korean Mathematical Society
    • /
    • v.56 no.5
    • /
    • pp.1273-1283
    • /
    • 2019
  • In matrix analysis, the Wielandt-Mirsky conjecture states that $$dist({\sigma}(A),{\sigma}(B)){\leq}{\parallel}A-B{\parallel}$$ for any normal matrices $A,B{\in}{\mathbb{C}}^{n{\times}n}$ and any operator norm ${\parallel}{\cdot}{\parallel}$ on $C^{n{\times}n}$. Here dist(${\sigma}(A),{\sigma}(B)$) denotes the optimal matching distance between the spectra of the matrices A and B. It was proved by A. J. Holbrook (1992) that this conjecture is false in general. However it is true for the Frobenius distance and the Frobenius norm (the Hoffman-Wielandt inequality). The main aim of this paper is to study the Hoffman-Wielandt inequality and some weaker versions of the Wielandt-Mirsky conjecture for matrix polynomials.

ON 2 × 2 STRONGLY CLEAN MATRICES

  • Chen, Huanyin
    • Bulletin of the Korean Mathematical Society
    • /
    • v.50 no.1
    • /
    • pp.125-134
    • /
    • 2013
  • An element in a ring R is strongly clean provided that it is the sum of an idempotent and a unit that commutate. In this note, several necessary and sufficient conditions under which a $2{\times}2$ matrix over an integral domain is strongly clean are given. These show that strong cleanness over integral domains can be characterized by quadratic and Diophantine equations.

ITERATIVE ALGORITHMS FOR THE LEAST-SQUARES SYMMETRIC SOLUTION OF AXB = C WITH A SUBMATRIX CONSTRAINT

  • Wang, Minghui;Feng, Yan
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.1_2
    • /
    • pp.1-12
    • /
    • 2009
  • Iterative algorithms are proposed for the least-squares symmetric solution of AXB = E with a submatrix constraint. We characterize the linear mappings from their independent element space to the constrained solution sets, study their properties and use these properties to propose two matrix iterative algorithms that can find the minimum and quasi-minimum norm solution based on the classical LSQR algorithm for solving the unconstrained LS problem. Numerical results are provided that show the efficiency of the proposed methods.

  • PDF

ELEMENTARY MATRIX REDUCTION OVER ZABAVSKY RINGS

  • Chen, Huanyin;Sheibani, Marjan
    • Bulletin of the Korean Mathematical Society
    • /
    • v.53 no.1
    • /
    • pp.195-204
    • /
    • 2016
  • We prove, in this note, that a Zabavsky ring R is an elementary divisor ring if and only if R is a $B{\acute{e}}zout$ ring. Many known results are thereby generalized to much wider class of rings, e.g. [4, Theorem 14], [7, Theorem 4], [9, Theorem 1.2.14], [11, Theorem 4] and [12, Theorem 7].

GLOBAL STABILITY ANALYSIS FOR A CLASS OF COHEN-GROSSBERG NEURAL NETWORK MODELS

  • Guo, Yingxin
    • Bulletin of the Korean Mathematical Society
    • /
    • v.49 no.6
    • /
    • pp.1193-1198
    • /
    • 2012
  • By constructing suitable Lyapunov functionals and combining with matrix inequality technique, a new simple sufficient condition is presented for the global asymptotic stability of the Cohen-Grossberg neural network models. The condition contains and improves some of the previous results in the earlier references.

SOME STRONGLY NIL CLEAN MATRICES OVER LOCAL RINGS

  • Chen, Huanyin
    • Bulletin of the Korean Mathematical Society
    • /
    • v.48 no.4
    • /
    • pp.759-767
    • /
    • 2011
  • An element of a ring is called strongly nil clean provided that it can be written as the sum of an idempotent and a nilpotent element that commute. A ring is strongly nil clean in case each of its elements is strongly nil clean. We investigate, in this article, the strongly nil cleanness of 2${\times}$2 matrices over local rings. For commutative local rings, we characterize strongly nil cleanness in terms of solvability of quadratic equations. The strongly nil cleanness of a single triangular matrix is studied as well.