A modified preconditioner for three-by-three block saddle point problems

被引：2
|
作者：
Li, Jun [1 ]
Li, Zhenping [1 ,2 ]
机构：
[1] Northwest Normal Univ, Coll Math & Stat, Lanzhou 730070, Peoples R China
[2] Luoyang Inst Sci & Technol, Dept Math & Phys, Luoyang 471023, Henan, Peoples R China
来源：
JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS | 2024年 / 41卷 / 01期
基金：
中国国家自然科学基金;
关键词：
Block saddle point problems; Iteration method; Convergence; Preconditioning; GMRES method; HERMITIAN SPLITTING METHODS; POSITIVE-DEFINITE; CONVERGENCE;
D O I：
10.1007/s13160-023-00625-3
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, inspired by the simplified relaxed alternating positive semi-definite splitting preconditioner (Xiong and Li in J Appl Math Comput, 2023), a modified preconditioner is established to solve the three-by-three block saddle point problems. The advantage of the modified preconditioner is that its parameters can be easy to select, which can avoid the work of the calculation of the parameters. Next, the spectral property of the preconditioned matrix with modified preconditioner is also discussed. In the end, three examples are provided to show the effectiveness of the modified preconditioner.
引用
收藏
页码：659 / 680
页数：22
相关论文
共 50 条
12345