A note on generalized stationary iterative method for solving saddle point problems
Li-Tao Zhang1, Hui-Li Meng2
COMPUTER MODELLING & NEW TECHNOLOGIES 2014 18(12A) 328-332
1Department of Mathematics and Physics, Zhengzhou Institute of Aeronautical Industry Management, Zhengzhou, Henan, 450015, P. R. China
2College of Computer and Information Engineering, Henan Normal University, Xinxiang, 453007, P.R. China
Recently, Miao and Wang [Journal of Applied Mathematics and Computing, 35(2011):459-468] studied the convergence of the generalized stationary iterative (GSI) method for solving the saddle point problems. In this paper, based on Miao and Wang’s convergence theorem, we perfect it and give new convergence conditions. Moveover, by using relaxation technique, we present an improved generalized stationary iterative (IGSI) method for solving the saddlepoint problems and analyze the convergence of the corresponding method.