Nested splitting conjugate gradient method for matrix equation AXB=CAXB=C and preconditioning

In this paper, we present a nested splitting conjugate gradient (NSCG) iteration method for solving a class of matrix equations with nonsymmetric coefficient matrices. This method is actually inner/outer iterations, which employs a CG-like method as inner iteration to approximate each outer iterate, while each outer iteration is induced by a convergent and symmetric positive definite splitting of the coefficient matrices. Convergence conditions of this method are studied in depth and numerical experiments show the efficiency of this method. Moreover, we show that the use of the quasi-Hermitian splitting as a preconditioner can induce an accurate, robust and effective preconditioned Krylov subspace method.

[1]  Gene H. Golub,et al.  Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems , 2002, SIAM J. Matrix Anal. Appl..

[2]  G. Golub,et al.  The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems , 1988 .

[3]  Iain S. Duff,et al.  Users' guide for the Harwell-Boeing sparse matrix collection (Release 1) , 1992 .

[4]  Z. Bai,et al.  Sufficient conditions for the convergent splittings of non-Hermitian positive definite matrices , 2001 .

[5]  Z. Bai.  ON HERMITIAN AND SKEW-HERMITIAN SPLITTING ITERATION METHODS FOR CONTINUOUS SYLVESTER EQUATIONS * , 2010 .

[6]  C. Kelley.  Iterative Methods for Linear and Nonlinear Equations , 1987 .

[7]  Lothar Reichel,et al.  Application of ADI Iterative Methods to the Restoration of Noisy Images , 1996, SIAM J. Matrix Anal. Appl..

[8]  Gene H. Golub,et al.  Matrix computations , 1983 .

[9]  L. Reichel,et al.  An extrapolated TSVD method for linear discrete ill-posed problems with Kronecker structure , 2011 .

[10]  Feng Ding,et al.  Gradient based iterative solutions for general linear matrix equations , 2009, Comput. Math. Appl..

[11]  O. Axelsson.  Iterative solution methods , 1995 .

[12]  Peter Benner,et al.  Gramian-Based Model Reduction for Data-Sparse Systems , 2008, SIAM J. Sci. Comput..

[13]  Khalide Jbilou,et al.  Block Krylov Subspace Methods for Solving Large Sylvester Equations , 2002, Numerical Algorithms.

[14]  Yan Feng,et al.  An iterative algorithm for solving a class of matrix equations , 2009 .

[15]  Yair Shapira,et al.  Iterative Methods for Large Sparse Linear Systems , 2006 .

[16]  H. Luetkepohl.  The Handbook of Matrices , 1996 .

[17]  Yuan Lei,et al.  Best Approximate Solution of Matrix Equation AXB+CYD=E , 2005, SIAM J. Matrix Anal. Appl..

[18]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[19]  Zhong-zhi,et al.  A SHIFT-SPLITTING PRECONDITIONER FOR NON-HERMITIAN POSITIVE DEFINITE MATRICES , 2006 .

[20]  Zhong-Zhi Bai,et al.  Splitting iteration methods for non-Hermitian positive definite systems of linear equations , 2007 .

[21]  Daniel Boley,et al.  Numerical Methods for Linear Control Systems , 1994 .

[22]  Li Wang,et al.  Convergence conditions for splitting iteration methods for non-Hermitian linear systems☆ , 2008 .

[23]  Davod Khojasteh Salkuyeh,et al.  New approaches for solving large Sylvester equations , 2006, Appl. Math. Comput..

[24]  Davod Khojasteh Salkuyeh,et al.  CG-type algorithms to solve symmetric matrix equations , 2006, Appl. Math. Comput..

[25]  Owe Axelsson,et al.  A Class of Nested Iteration Schemes for Linear Systems with a Coefficient Matrix with a Dominant Positive Definite Symmetric Part , 2004, Numerical Algorithms.

[26]  Bai,et al.  A REGULARIZED CONJUGATE GRADIENT METHOD FOR SYMMETRIC POSITIVE DEFINITE SYSTEM OF LINEAR EQUATIONS , 2002 .

[27]  Zhong-Zhi Bai,et al.  Iterative orthogonal direction methods for Hermitian minimum norm solutions of two consistent matrix equations , 2006, Numer. Linear Algebra Appl..