Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Niu et al. (2010) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: