Improved PPHSS iterative methods for solving nonsingular and singular saddle point problems

详细信息    查看全文

• 作者：Zheng-Ge Huang ; ^{ZhenggeHuang@mail.nwpu.edu.cn" class="auth_mail" title="E-mail the corresponding author} ; Li-Gong Wang ^{lgwang@nwpu.edu.cn" class="auth_mail" title="E-mail the corresponding author} ; Zhong Xu ^{zhongxu@nwpu.edu.cn" class="auth_mail" title="E-mail the corresponding author} ; Jing-Jing Cui ^{JingjingCui@mail.nwpu.edu.cn" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Saddle point problem ; IPPHSS method ; Convergence ; Semi-convergence ; Preconditioner
• 刊名：Computers & Mathematics with Applications
• 出版年：2016
• 出版时间：July 2016
• 年：2016
• 卷：72
• 期：1
• 页码：92-109
• 全文大小：736 K

文摘

Based on the parameterized preconditioned Hermitian and skew-Hermitian splitting iteration method (PPHSS), proposed by Li et al. (2014) for saddle point problems, an improvement on the PPHSS method (IPPHSS) is presented in this paper. By adding a block lower triangular matrix to the coefficient matrix on two sides of the first equation of the PPHSS iterative scheme, both the number of iterations and the consume time are decreased. We provide the convergence and semi-convergence analysis of the IPPHSS method, which show that this method is convergence and semi-convergence if the related parameters satisfy suitable restrictions. Furthermore, we discuss the spectral properties of the corresponding preconditioned matrix of the IPPHSS method. Finally, numerical examples show that the IPPHSS method is better than the PPHSS, PHSS and AHSS methods both as a solver and as a preconditioner for the GMRES method.