A preconditioned iteration method for solving sylvester equations

Jituan Zhou; Ruirui Wang; Qiang Niu

doi:10.1155/2012/401059

A preconditioned iteration method for solving sylvester equations

Jituan Zhou, Ruirui Wang^*, Qiang Niu

^*Corresponding author for this work

Department of Applied Mathematics

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

6 Citations (Scopus)

Abstract

A preconditioned gradient-based iterative method is derived by judicious selection of two auxil- iary matrices. The strategy is based on the Newtons iteration method and can be regarded as a generalization of the splitting iterative method for system of linear equations. We analyze the convergence of the method and illustrate that the approach is able to considerably accelerate the convergence of the gradient-based iterative method.

Original language	English
Article number	401059
Journal	Journal of Applied Mathematics
Volume	2012
DOIs	https://doi.org/10.1155/2012/401059
Publication status	Published - 2012

Access to Document

10.1155/2012/401059

Cite this

@article{e969ed6a6dcc448aaf4685f44690e42a,

title = "A preconditioned iteration method for solving sylvester equations",

abstract = "A preconditioned gradient-based iterative method is derived by judicious selection of two auxil- iary matrices. The strategy is based on the Newtons iteration method and can be regarded as a generalization of the splitting iterative method for system of linear equations. We analyze the convergence of the method and illustrate that the approach is able to considerably accelerate the convergence of the gradient-based iterative method.",

author = "Jituan Zhou and Ruirui Wang and Qiang Niu",

year = "2012",

doi = "10.1155/2012/401059",

language = "English",

volume = "2012",

journal = "Journal of Applied Mathematics",

issn = "1110-757X",

}

TY - JOUR

T1 - A preconditioned iteration method for solving sylvester equations

AU - Zhou, Jituan

AU - Wang, Ruirui

AU - Niu, Qiang

PY - 2012

Y1 - 2012

N2 - A preconditioned gradient-based iterative method is derived by judicious selection of two auxil- iary matrices. The strategy is based on the Newtons iteration method and can be regarded as a generalization of the splitting iterative method for system of linear equations. We analyze the convergence of the method and illustrate that the approach is able to considerably accelerate the convergence of the gradient-based iterative method.

AB - A preconditioned gradient-based iterative method is derived by judicious selection of two auxil- iary matrices. The strategy is based on the Newtons iteration method and can be regarded as a generalization of the splitting iterative method for system of linear equations. We analyze the convergence of the method and illustrate that the approach is able to considerably accelerate the convergence of the gradient-based iterative method.

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

U2 - 10.1155/2012/401059

DO - 10.1155/2012/401059

M3 - Article

AN - SCOPUS:84864961250

SN - 1110-757X

VL - 2012

JO - Journal of Applied Mathematics

JF - Journal of Applied Mathematics

M1 - 401059

ER -

A preconditioned iteration method for solving sylvester equations

Abstract

Access to Document

Other files and links

Cite this