Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4631385 | Applied Mathematics and Computation | 2012 | 9 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Xiang Wang, Lin Dai, Dan Liao,