Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017 (2017), Article ID 1624969, 8 pages
Research Article

The Relaxed Gradient Based Iterative Algorithm for the Symmetric (Skew Symmetric) Solution of the Sylvester Equation

1School of Information and Computer, Anhui Agricultural University, Hefei 230036, China
2School of Mathematics and Statistics, Fuyang Normal College, Anhui 236037, China

Correspondence should be addressed to Xingping Sheng

Received 26 February 2017; Accepted 23 March 2017; Published 3 April 2017

Academic Editor: Jean Jacques Loiseau

Copyright © 2017 Xiaodan Zhang and Xingping Sheng. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


In this paper, we present two different relaxed gradient based iterative (RGI) algorithms for solving the symmetric and skew symmetric solution of the Sylvester matrix equation . By using these two iterative methods, it is proved that the iterative solution converges to its true symmetric (skew symmetric) solution under some appropriate assumptions when any initial symmetric (skew symmetric) matrix is taken. Finally, two numerical examples are given to illustrate that the introduced iterative algorithms are more efficient.