Search

Solutions are constructed for the Kalman-Yakubovich-transpose equation X−AXTB=C. The solutions are stated as a polynomial of parameters of the matrix equation. One of the polynomial solutions is expressed by the symmetric operator matrix, controllability matrix, and observability matrix. Moreover, the explicit solution is proposed when the Kalman-Yakubovich-transpose matrix equation has a unique solution. The provided approach does not require the coefficient matrices to be in canonical form. In addition, the numerical example is given to illustrate the effectiveness of the derived method. Some applications in control theory are discussed at the end of this paper.

This paper considers the stable set and coloring problems of hypergraphs and presents several new results and algorithms using the semitensor product of matrices. By the definitions of an incidence matrix of a hypergraph and characteristic logical vector of a vertex subset, an equivalent algebraic condition is established for hypergraph stable sets, as well as a new algorithm, which can be used to search all the stable sets of any hypergraph. Then, the vertex coloring problem is investigated, and a necessary and sufficient condition in the form of algebraic inequalities is derived. Furthermore, with an algorithm, all the coloring schemes and minimum coloring partitions with the given q colors can be calculated for any hypergraph. Finally, one illustrative example and its application to storing problem are provided to show the effectiveness and applicability of the theoretical results.

This paper is concerned with the singular LQ problem for irregular singular systems with persistent disturbances. The full information feedback control method is employed to achieve the optimal control. By restricted system equivalence transformation, the system state is decomposed into free state and restricted state and the input is decomposed into free input and forced input. Some sufficient conditions for the unique existence of optimal control-state pair are derived and these conditions are all described unitedly with matrix rank equalities. The optimal control-state pair can be explicitly formulated via solving an algebraic Riccati equation and a Sylvester equation. Moreover, under the optimal control-state pair, the resulting system has no free state.

Solutions are constructed for the Kalman-Yakubovich-transpose equation X - AXT B = C. The solutions are stated as a polynomial of parameters of the matrix equation. One of the polynomial solutions is expressed by the symmetric operatormatrix, controllability matrix, and observability matrix. Moreover, the explicit solution is proposed when the Kalman-Yakubovich-transpose matrix equation has a unique solution. The provided approach does not require the coefficient matrices to be in canonical form. In addition, the numerical example is given to illustrate the effectiveness of the derived method. Some applications in control theory are discussed at the end of this paper. [ABSTRACT FROM AUTHOR]