Journal of Northeastern University:Natural Science ›› 2017, Vol. 38 ›› Issue (6): 909-912.DOI: 10.12068/j.issn.1005-3026.2017.06.029

• Mathematics • Previous Articles    

Iterative Solutions to Sylvester Matrix Equations

SHAO Xin-hui, PENG Cheng   

  1. School of Sciences, Northeastern University, Shenyang 110819, China.
  • Received:2015-12-30 Revised:2015-12-30 Online:2017-06-15 Published:2017-06-11
  • Contact: SHAO Xin-hui
  • About author:-
  • Supported by:
    -

Abstract: The gradient-based iterative solutions to Sylvester matrix equations are given. By introducing a relaxation parameter and applying the hierarchical identification principle, an iterative algorithm is constructed to solve Sylvester matrix equations. Convergence analysis indicates that the iterative solutions converge with the exact solutions to any initial value under certain assumptions. Numerical examples are given to testify the efficiency of the proposed method.

Key words: Sylvester matrix equation, iterative solution, gradient, convergence, relaxation parameter

CLC Number: