Finite iterative algorithms for the generalized Sylvester-conjugate matrix equation {AX+BY=E\overline{X}F+S} |
| |
Authors: | Ai-Guo Wu Guang-Ren Duan Yan-Ming Fu Wei-Jun Wu |
| |
Affiliation: | 1. Information and Control Research Center, Harbin Institute of Technology Shenzhen Graduate School, Shenzhen, 518055, People’s Republic of China 2. Center for Control Theory and Guidance Technology, Harbin Institute of Technology, Harbin, 150001, People’s Republic of China 3. National Key Laboratory of Antennas and Microwave Technology, Xidian University, Xi’an, 710071, People’s Republic of China
|
| |
Abstract: | This paper investigates the generalized Sylvester-conjugate matrix equation, which includes the normal Sylvester-conjugate, Kalman–Yakubovich-conjugate and generalized Sylvester matrix equations as its special cases. An iterative algorithm is presented for solving such a kind of matrix equations. This iterative method can give an exact solution within finite iteration steps for any initial values in the absence of round-off errors. Another feature of the proposed algorithm is that it is implemented by original coefficient matrices. By specifying the proposed algorithm, iterative algorithms for some special matrix equations are also developed. Two numerical examples are given to illustrate the effectiveness of the proposed methods. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|