A new generalized shift-splitting method for nonsymmetric saddle point problems

被引：2
作者：
Wei, Tao [1 ]
Zhang, Li-Tao [2 ,3 ,4 ]
机构：
[1] Henan Univ Engn, Sch Software, Zhengzhou, Henan, Peoples R China
[2] Zhengzhou Univ Aeronaut, Sch Math, Zhengzhou, Henan, Peoples R China
[3] Collaborat Innovat Ctr Aviat Econ Dev Henan Prov, Zhengzhou, Henan, Peoples R China
[4] Henan Normal Univ, Coll Math & Informat Sci, Xinxiang, Henan, Peoples R China
来源：
ADVANCES IN MECHANICAL ENGINEERING | 2022年 / 14卷 / 08期
基金：
中国国家自然科学基金;
关键词：
Shift-splitting iteration; nonsymmetric saddle point problems; convergence; Krylov subspace methods; eigenvalue; SYMMETRIC SOR METHOD; ITERATION METHODS; UZAWA METHODS; INEXACT; PRECONDITIONERS; CONVERGENCE;
D O I：
10.1177/16878132221119451
中图分类号：
O414.1 [热力学];
学科分类号：
摘要：
Recently, Huang and Huang [Journal of Computational and Applied Mathematics, 328 (2018) 381-399] proposed a modified generalized shift-splitting preconditioned (denoted by MGSSP) method for solving large sparse saddle point problems, and gave the corresponding theoretical analysis and numerical experiments. In this paper, based on the modified generalized shift-splitting preconditioned (MGSSP) method, we generalize the MGSSP algorithms and further present the new generalized shift-splitting preconditioned (NGSSP) method for nonsymmetric saddle point problems. Moreover, by similar theoretical analysis, we analyze the convergence conditions of the corresponding matrix splitting iteration methods of the NGSSP preconditioned saddle point matrices. In final, one example is provided to confirm the effectiveness. MSC: 65F10, 65F15, 65F50
引用
收藏
页数：11
相关论文
共 50 条
12345