Arelaxed gradient based al gorithm for solving Sylvester equations

Qiang Niu; Xiang Wang; Lin Zhang Lu

doi:10.1002/asjc.328

Arelaxed gradient based al gorithm for solving Sylvester equations

Qiang Niu^*, Xiang Wang, Lin Zhang Lu

^*Corresponding author for this work

Department of Applied Mathematics

Research output: Contribution to journal › Article › peer-review

85 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	461-464
Number of pages	4
Journal	Asian Journal of Control
Volume	13
Issue number	3
DOIs	https://doi.org/10.1002/asjc.328
Publication status	Published - May 2011

Keywords

Iterative method
Relaxation parameter
Sylvester equation

Access to Document

10.1002/asjc.328

Cite this

@article{a1113e3875ff4dad902da9a2623d8fa6,

title = "Arelaxed gradient based al gorithm for solving Sylvester equations",

abstract = "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.",

keywords = "Iterative method, Relaxation parameter, Sylvester equation",

author = "Qiang Niu and Xiang Wang and Lu, {Lin Zhang}",

year = "2011",

month = may,

doi = "10.1002/asjc.328",

language = "English",

volume = "13",

pages = "461--464",

journal = "Asian Journal of Control",

issn = "1561-8625",

number = "3",

}

TY - JOUR

T1 - Arelaxed gradient based al gorithm for solving Sylvester equations

AU - Niu, Qiang

AU - Wang, Xiang

AU - Lu, Lin Zhang

PY - 2011/5

Y1 - 2011/5

N2 - 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.

AB - 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.

KW - Iterative method

KW - Relaxation parameter

KW - Sylvester equation

UR - http://www.scopus.com/inward/record.url?scp=84862908727&partnerID=8YFLogxK

U2 - 10.1002/asjc.328

DO - 10.1002/asjc.328

M3 - Article

AN - SCOPUS:84862908727

SN - 1561-8625

VL - 13

SP - 461

EP - 464

JO - Asian Journal of Control

JF - Asian Journal of Control

IS - 3

ER -

Arelaxed gradient based al gorithm for solving Sylvester equations

Abstract

Keywords

Access to Document

Other files and links

Cite this