THE MODIFIED DOUBLE SHIFT-SPLITTING PRECONDITIONER FOR NONSYMMETRIC GENERALIZED SADDLE POINT PROBLEMS FROM THE TIME-HARMONIC MAXWELL EQUATIONS
Recently, Fan, Zhu and Zheng [<i>Computational and Applied Mathematics</i>, 37(3), 3256-3266] proposed a generalized double shift-splitting (GDSS) preconditioner induced by a new matrix splitting method for nonsymmetric generalized saddle point problems, and gave the corresponding theoretical analysis and numerical experiments. In this paper, based on the generalized double shift-splitting (GDSS) preconditioner, we generalize the GDSS algorithms and further present the modified double shift-splitting (MDSS) preconditioner for nonsymmetric generalized saddle point problems having a nonsymmetric positive definite (1,1)-block and a positive definite (2,2)-block. Moreover, by similar theoretical analysis, we analyze the convergence conditions of the corresponding matrix splitting iteration methods and preconditioning properties of the MDSS preconditioned saddle point matrices. In final, one example is provided to confirm the effectiveness.
Authors
- Guangxu Zhu (ORCID: https://orcid.org/0000-0001-9532-9201)
- Litao Zhang
- Haochen Zhao (ORCID: https://orcid.org/0000-0002-3854-4682)
- Boming Zhang (ORCID: https://orcid.org/0000-0003-4430-3997)
Publication Details
- Journal
- Journal of Applied Analysis & Computation
- Published
- 2025-01-01
- DOI
- https://doi.org/10.11948/20240279
- Primary Topic
- Matrix Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00