• East Asian mathematical journal
• /
• 제30권3호
• /
• pp.311-319
• /
• 2014

It is shown that, for an even positive integer m with $m{\geq}4$ and arbitrary positive integer k and t, the complete multipartite graph $K_{km+1(2t)}$ can be decomposed into edge-disjoint gregarious m-cycles in such a way that the decomposition is circulant.

• Journal of applied mathematics & informatics
• /
• 제14권1_2호
• /
• pp.81-96
• /
• 2004

The level-m scaled circulant factor matrix over the complex number field is introduced. Its diagonalization and spectral decomposition and representation are discussed. An explicit formula for the entries of the inverse of a level-m scaled circulant factor matrix is presented. Finally, an algorithm for finding the inverse of such matrices over the quaternion division algebra is given.

• East Asian mathematical journal
• /
• 제33권1호
• /
• pp.67-74
• /
• 2017

Let k, m and t be positive integers with $m{\geq}4$ and even. It is shown that $K_{km+1(2t)}$ has a decomposition into gregarious m-cycles. Also, it is shown that $K_{km(2t)}$ has a decomposition into gregarious m-cycles if ${\frac{(m-1)^2+3}{4m}}$ < k. In this article, we make a remark that the decompositions can be circulant in the sense that it is preserved by the cyclic permutation of the partite sets, and we will exhibit it by examples.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.313-316
• /
• 1997

Two different issues, design of reduced-order robust model predictive control and input signal design for identification of a MIMO system, are addressed and design techniques based on singular value decomposition(SVD) of the pulse response circulant matrix(PRCM) are proposed. For this, we investigate the properties of the PRCM, which is a periodic approximation of a linear discrete-time system, and show its SVD represents the directional as well as the frequency decomposition of the system. Usefulness of the PRCM and effectiveness of the proposed design techniques are demonstrated through numerical examples.

• 제어로봇시스템학회논문지
• /
• 제4권4호
• /
• pp.413-419
• /
• 1998

A novel order-reduction technique for model predictive control(MPC) is proposed based on the singular value decomposition(SVD) of a pulse response circulant matrix(PRCM) of a concerned system. It is first investigated that the PRCM (in the limit) contains a complete information of the frequency response of a system and its SVD decomposes the information into the respective principal directions at each frequency. This enables us to isolate the significant modes of the system and to devise the proposed order-reduction technique. Though the primary purpose of the proposed technique is to diminish the required computation in MPC, the clear frequency decomposition of the SVD of the PRCM also enables us to improve the robustness through selective excitation of frequency modes. Performance of the proposed technique is illustrated through two numerical examples.

• International Journal of Control, Automation, and Systems
• /
• 제5권5호
• /
• pp.508-514
• /
• 2007

Properties and potential applications of the block pulse response circulant matrix (PRCM) and its singular value decomposition (SVD) are investigated in relation to MIMO control and identification. The SVD of the PRCM is found to provide complete directional as well as frequency decomposition of a MIMO system in a real matrix form. Three examples were considered: design of MIMO FIR controller, design of robust reduced-order model predictive controller, and input design for MIMO identification. The examples manifested the effectiveness and usefulness of the PRCM in the design of MIMO control and identification. irculant matrix, SVD, MIMO control, identification.

• East Asian mathematical journal
• /
• 제26권5호
• /
• pp.655-670
• /
• 2010

The complete multipartite graph $K_{n(m)}$ with n $ {\geq}$ 4 partite sets of size m is shown to have a decomposition into 4-cycles in such a way that vertices of each cycle belong to distinct partite sets of $K_{n(m)}$, if 4 divides the number of edges. Such cycles are called gregarious, and were introduced by Billington and Hoffman ([2]) and redefined in [3]. We independently came up with the result of [3] by using a difference set method, and improved the result so that the composition is circulant, in the sense that it is invariant under the cyclic permutation of partite sets. The composition is then used to construct gregarious 4-cycle decompositions when one partite set of the graph has different cardinality than that of others. Some results on joins of decomposable complete multipartite graphs are also presented.