Year: 2025
Type: article
Abstract: Recently, Zheng and Lu [International Journal of Computer Mathematics, 96(1): 1-17, DOI: 10.1080/00207160.2017.1420179 ] constructed a parameterized matrix splitting (PMS) preconditioner for the large sparse saddle point problems, and gave the corresponding theoretical analysis and numerical experiments. In this paper, based on the parameterized matrix splitting, we generalize the PMS algorithms and further present the new parameterized matrix splitting (NPMS) preconditioner for the saddle point problems. Moreover, by similar theoretical analysis, we analyze the convergence conditions of the corresponding matrix splitting iteration methods and preconditioning properties of the NPMS preconditioned saddle point matrices. Finally, one example is provided to confirm the effectiveness.
DOI: 10.11948/20240515
Authors: Li-Tao Zhang, Guang-Xu Zhu
Institution: Zhengzhou University of Aeronautics
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4411533652