.png){kind=icon}
Return
A modified gradient based algorithm for solving Sylvester equations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2011.11.055.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper a modified gradient based algorithm for solving Sylvester equations is presented. Different from the gradient based method introduced by Ding and Chen [7] and the relaxed gradient based algorithm proposed by Niu et al. [18], the information generated in the first half-iterative step is fully exploited and used to construct the approximate solution. Theoretical analysis shows that the new method converges under certain assumptions. Numerical results are given to verify the efficiency of the new method. (C) 2011 Elsevier Inc. All rights reserved.
Keywords:
Sylvester equations
Gradient based algorithm
Modified gradient based algorithm
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
Cited Papers
ShareSaveImplicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations
PREAI
ShareSaveSonochemical synthesis of reduced graphene oxide uniformly decorated with hierarchical ZnS nanospheres and its enhanced photocatalytic activities.png)
RSC Advances
OAAI
RSC AdvancesIF0
OAAIShareSave
ShareSave
View more