期刊
APPLIED MATHEMATICS AND COMPUTATION
卷 217, 期 22, 页码 9380-9386出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2011.04.026
关键词
Matrix equations; Gradient search principle; Krylov subspace; Iterative; Convergence
资金
- Shanghai Municipal Education Commission [J50101]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据