A relaxed gradient based algorithm for solving sylvester equations
A relaxed gradient based algorithm for solving sylvester equations
复制标题
DOI：
10.1002/asjc.328
复制
发表时间：
2011-05
影响因子：
2.4
通讯作者：
Q. Niu;Xiang Wang;Linzhang Lu
中科院分区：
文献类型：
--
作者：
Q. Niu;Xiang Wang;Linzhang Lu
通过引入松弛参数，给出了求解Sylvester方程的松弛梯度迭代算法。理论分析表明，在一定的假设条件下，新方法是收敛的。与原算法进行了比较，结果表明，在较宽的松弛参数范围内，新算法具有较快的收敛速度。
By introducing a relaxation parameter, we derive a relaxed gradient based iterative algorithm for solving Sylvester equations. Theoretical analysis shows that the new method converges under certain assumptions. Comparisons are performed with the original algorithm, and results show that the new method exhibits fast convergence behavior with a wide range of relaxation parameters.