科研之友
微信
新浪微博
Facebook
分享链接
摘要
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.
