Journal
APPLIED MATHEMATICAL MODELLING
Volume 35, Issue 10, Pages 4675-4683Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.apm.2011.03.038
Keywords
Coupled Sylvester-transpose matrix equation; Iterative algorithm; Iterative solution; Convergence; Spectral norm
Funding
- NSFC [11071079, 10901056]
- Shanghai Nature Science Foundation [092R1408700]
- Zhejiang Nature Science Foundation [Y6110043]
Ask authors/readers for more resources
This note studies the iterative solutions to the coupled Sylvester-transpose matrix equation with a unique solution. By using the hierarchical identification principle, an iterative algorithm is presented for solving this class of coupled matrix equations. It is proved that the iterative solution consistently converges to the exact solution for any initial values. Meanwhile, sufficient conditions are derived to guarantee that the iterative solutions given by the proposed algorithm converge to the exact solution for any initial matrices. Finally, a numerical example is given to illustrate the efficiency of the proposed approach. (C) 2011 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available