4.4 Article

A RELAXED GRADIENT BASED ALGORITHM FOR SOLVING SYLVESTER EQUATIONS

Journal

ASIAN JOURNAL OF CONTROL
Volume 13, Issue 3, Pages 461-464

Publisher

WILEY
DOI: 10.1002/asjc.328

Keywords

Sylvester equation; iterative method; relaxation parameter

Funding

  1. National Natural Science Foundation of China [10961010]
  2. The Education Department of Jiangxi Province [GJJ09405]
  3. Nanchang University

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available