Journal
APPLIED MATHEMATICS AND COMPUTATION
Volume 217, Issue 22, Pages 9380-9386Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2011.04.026
Keywords
Matrix equations; Gradient search principle; Krylov subspace; Iterative; Convergence
Categories
Funding
- Shanghai Municipal Education Commission [J50101]
Ask authors/readers for more resources
Recently, Ding and Chen [F. Ding, T. Chen, On iterative solutions of general coupled matrix equations, SIAM J. Control Optim. 44 (2006) 2269-2284] developed a gradient-based iterative method for solving a class of coupled Sylvester matrix equations. The basic idea is to regard the unknown matrices to be solved as parameters of a system to be identified, so that the iterative solutions are obtained by applying hierarchical identification principle. In this note, by considering the coupled Sylvester matrix equation as a linear operator equation we give a natural way to derive this algorithm. We also propose some faster algorithms and present some numerical results. (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