On the numerical solution of generalized Sylvester matrix equations

Document Type : Research Paper




‎The global FOM and GMRES algorithms are among the effective‎
‎methods to solve Sylvester matrix equations‎. ‎In this paper‎, ‎we‎
‎study these algorithms in the case that the coefficient matrices‎
‎are real symmetric (real symmetric positive definite) and extract‎
‎two CG-type algorithms for solving generalized Sylvester matrix‎
‎equations‎. ‎The proposed methods are iterative projection methods‎
‎onto matrix Krylov subspaces‎. ‎Numerical examples are presented‎.


Main Subjects

Volume 40, Issue 1 - Serial Number 1
February 2014
Pages 101-113
  • Receive Date: 16 November 2011
  • Revise Date: 17 December 2012
  • Accept Date: 17 December 2012
  • First Publish Date: 01 February 2014