Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4975316 | Journal of the Franklin Institute | 2014 | 14 Pages |
Abstract
This paper deals with the generalized Sylvester equation in polynomial matrices A(λ)X(λ)+Y(λ)B(λ)=C(λ), where A(λ) and B(λ) are monic. If the equation has solutions, then it has a solution satisfying a natural degree constraint condition. It is shown that the generalized Sylvester equation in polynomial matrices can be reduced to the linear matrix equation ARnY+âi=0nâ1ARiYBi=C, where AR is the second block-companion matrix of A(λ).
Related Topics
Physical Sciences and Engineering
Computer Science
Signal Processing
Authors
Sheng Chen, Yunbo Tian,