On global Hessenberg based methods for solving Sylvester matrix equations

Abstract In the first part of this paper, we investigate the use of Hessenberg-based methods for solving the Sylvester matrix equation A X + X B = C . To achieve this goal, the Sylvester form of the global generalized Hessenberg process is presented. Using this process, different methods based on a Petrov–Galerkin or on a minimal norm condition are derived. In the second part, we focus on the SGl-CMRH method which is based on the Sylvester form of the Hessenberg process with pivoting strategy combined with a minimal norm condition. In order to accelerate the SGl-CMRH method, a preconditioned framework of this method is also considered. It includes both fixed and flexible variants of the SGl-CMRH method. Moreover, the connection between the flexible preconditioned SGl-CMRH method and the fixed one is studied and some upper bounds for the residual norm are obtained. In particular, application of the obtained theoretical results is investigated for the special case of solving linear systems of equations with several right-hand sides. Finally, some numerical experiments are given in order to evaluate the effectiveness of the proposed methods.

[1]  Changfeng Ma,et al.  An iterative algorithm for the least Frobenius norm least squares solution of a class of generalized coupled Sylvester-transpose linear matrix equations , 2018, Appl. Math. Comput..

[2]  Changfeng Ma,et al.  On the least squares generalized Hamiltonian solution of generalized coupled Sylvester-conjugate matrix equations , 2017, Comput. Math. Appl..

[3]  Richard F. Barrett,et al.  Matrix Market: a web resource for test matrix collections , 1996, Quality of Numerical Software.

[4]  Lei Du,et al.  Restarted Hessenberg method for solving shifted nonsymmetric linear systems , 2015, J. Comput. Appl. Math..

[5]  Y. Saad,et al.  Krylov Subspace Methods on Supercomputers , 1989 .

[6]  Hassane Sadok,et al.  CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm , 1999, Numerical Algorithms.

[7]  M. Heyouni,et al.  Extended Arnoldi methods for large low-rank Sylvester matrix equations , 2010 .

[8]  Chuanqing Gu,et al.  Flexible global generalized Hessenberg methods for linear systems with multiple right-hand sides , 2014, J. Comput. Appl. Math..

[9]  Valeria Simoncini,et al.  Computational Methods for Linear Matrix Equations , 2016, SIAM Rev..

[10]  Hassane Sadok,et al.  A new implementation of the CMRH method for solving dense linear systems , 2008 .

[11]  Changfeng Ma,et al.  Alternating direction method for generalized Sylvester matrix equation AXB + CYD = E , 2015, Appl. Math. Comput..

[12]  M. Benzi.  Preconditioning techniques for large linear systems: a survey , 2002 .

[13]  Khalide Jbilou,et al.  Low rank approximate solutions to large Sylvester matrix equations , 2006, Appl. Math. Comput..

[14]  Agoujil Said.  A Minimal Residual Norm Method For Large-Scale Sylvester Matrix Equations , 2014 .

[15]  M. Heyouni,et al.  Matrix Krylov subspace methods for linear systems with multiple right-hand sides , 2005, Numerical Algorithms.

[16]  Daniel B. Szyld,et al.  FQMR: A Flexible Quasi-Minimal Residual Method with Inexact Preconditioning , 2001, SIAM J. Sci. Comput..

[17]  Changfeng Ma,et al.  A matrix CRS iterative method for solving a class of coupled Sylvester-transpose matrix equations , 2017, Comput. Math. Appl..

[18]  Valeria Simoncini,et al.  Recent computational developments in Krylov subspace methods for linear systems , 2007, Numer. Linear Algebra Appl..

[19]  H. Sadok,et al.  Global FOM and GMRES algorithms for matrix equations , 1999 .

[20]  Khalide Jbilou,et al.  Model reduction in large scale MIMO dynamical systems via the block Lanczos method , 2008 .

[21]  Mohammed Heyouni.  Méthode de Hessenberg généralisée et applications , 1996 .

[22]  Abderrahman Bouhamidi,et al.  A note on the numerical approximate solutions for generalized Sylvester matrix equations with applications , 2008, Appl. Math. Comput..

[23]  Hassane Sadok,et al.  On a variable smoothing procedure for Krylov subspace methods , 1998 .

[24]  Hassane Sadok,et al.  A new look at CMRH and its relation to GMRES , 2012 .

[25]  R. Weiss.  A theoretical overview of Krylov subspace methods , 1995 .

[26]  M. Heyouni,et al.  The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides , 2001, Numerical Algorithms.

[27]  Khalide Jbilou,et al.  Matrix Krylov subspace methods for large scale model reduction problems , 2006, Appl. Math. Comput..