...
首页> 外文期刊>Computers & mathematics with applications >Gradient-based iterative algorithms for generalized coupled Sylvester-conjugate matrix equations
【24h】

Gradient-based iterative algorithms for generalized coupled Sylvester-conjugate matrix equations

机译:广义耦合Sylvester-共轭矩阵方程的基于梯度的迭代算法

获取原文
获取原文并翻译 | 示例

摘要

By applying the hierarchical identification principle, the gradient-based iterative algorithm is suggested to solve a class of complex matrix equations. With the real representation of a complex matrix as a tool, the sufficient and necessary conditions for the convergence factor are determined to guarantee that the iterative solutions given by the proposed algorithm converge to the exact solution for any initial matrices. Also, we solve the problem which is proposed by Wu et al. (2010). Finally, some numerical examples are provided to illustrate the effectiveness of the proposed algorithms and testify the conclusions suggested in this paper. (C) 2017 Elsevier Ltd. All rights reserved.
机译:通过应用层次识别原理,提出了基于梯度的迭代算法来求解一类复杂的矩阵方程。以复杂矩阵的真实表示为工具,确定收敛因子的充要条件,以确保所提算法给出的迭代解收敛于任何初始矩阵的精确解。此外,我们解决了Wu等人提出的问题。 (2010)。最后,提供了一些数值例子来说明所提算法的有效性,并证明本文提出的结论。 (C)2017 Elsevier Ltd.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号