On preconditioned generalized shift-splitting iteration methods for saddle point problems

We study a preconditioned generalized shift-splitting iteration method for solving saddle point problems. The unconditional convergence theory of the preconditioned generalized shift-splitting iteration method is established. When the splitting matrix is used as a preconditioner, we analyze eigenvalue distribution of the preconditioned saddle point matrix. It is proved that complex eigenvalues having nonzero imaginary parts of the preconditioned matrix are located in an intersection of two circles and the real parts of all eigenvalues of the preconditioned matrix are located in a positive interval. Numerical experiments are used to verify our theoretical results and illustrate effectiveness of the proposed iteration method and the corresponding splitting preconditioner. (C) 2017 Elsevier Ltd. All rights reserved.