首页> 外文会议>Chinese Control and Decision Conference >Gradient-based iterative algorithm for the extended coupled Sylvester matrix equations
【24h】

Gradient-based iterative algorithm for the extended coupled Sylvester matrix equations

机译:扩展耦合Sylvester矩阵方程的基于梯度的迭代算法

获取原文

摘要

A gradient-based iterative algorithm is established for solving the extended coupled Sylvester matrix equations AXB + AY B = F and CXD + CY D = F by using the hierarchical identification principle. We prove that the iterative solution converges fast to the exact one for any initial iterative value if the coupled matrix equations has a unique solution. A numerical example is offered to illustrate the efficiency of the proposed algorithm.
机译:建立了基于梯度的迭代算法,通过使用分层识别原理来求解扩展耦合的Sylvester矩阵方程AXB + AY B = F和CXD + CY D =F。我们证明,如果耦合矩阵方程具有唯一解,则对于任何初始迭代值,迭代解都可以快速收敛到精确的解。数值例子说明了所提算法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号