A modified generalized shift-splitting preconditioner for nonsymmetric saddle point problems

DOI10.1007/S11075-017-0377-YMaRDI QIDQ1751070zbMATH OpenOpenAlexFDO

Authors Zheng-Ge Huang, Ligong Wang, Zhong Xu, Jingjing Cui

Publication date 23 May 2018

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1701.04157

zbMATH Keywords

convergencesemi-convergencespectral propertiesnonsymmetric saddle point problemmodified generalized shift-splitting

Mathematics Subject Classification ID

Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)

Abstract: For the nonsymmetric saddle point problems with nonsymmetric positive definite (1,1) parts, the modified generalized shift-splitting (MGSSP) preconditioner as well as the MGSSP iteration method are derived in this paper, which generalize the MSSP preconditioner and the MSSP iteration method newly developed by Huang and Su (J. Comput. Appl. Math. 2017), respectively. The convergent and semi-convergent analysis of the MGSSP iteration method are presented, and we prove that this method is unconditionally convergent and semi-convergent. In addition, some spectral properties of the preconditioned matrix are carefully analyzed. Numerical results demonstrate the robustness and effectiveness of the MGSSP preconditioner and the MGSSP iteration method, and also illustrate that the MGSSP iteration method outperforms the GSS and GMSS iteration methods, and the MGSSP preconditioner is superior to the shift-splitting (SS), generalized SS (GSS), modified SS (MSS) and generalized MSS (GMSS) preconditioners for the GMRES method for solving the nonsymmetric saddle point problems.

Recommendations

• The generalized modified shift-splitting preconditioners for nonsymmetric saddle point problems
• The modified shift-splitting preconditioners for nonsymmetric saddle-point problems
• A modified generalized shift-splitting method for nonsymmetric saddle point problems
• Parameterized generalized shift-splitting preconditioners for nonsymmetric saddle point problems
• New modified shift-splitting preconditioners for non-symmetric saddle point problems

Cites work

• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• scientific article; zbMATH DE number 3793774 (Why is no real title available?)
• A class of generalized shift-splitting preconditioners for nonsymmetric saddle point problems
• A generalization of parameterized inexact Uzawa method for singular saddle point problems
• A generalized shift-splitting preconditioner for saddle point problems
• A generalized shift-splitting preconditioner for singular saddle point problems
• A modified SOR-like method for the augmented systems
• A modified shift-splitting method for nonsymmetric saddle point problems
• A new generalized parameterized inexact Uzawa method for solving saddle point problems
• A practical asymptotical optimal SOR method
• A practical formula for computing optimal parameters in the HSS iteration methods
• A shift-splitting preconditioner for non-Hermitian positive definite matrices
• A triple-parameter modified SSOR method for solving singular saddle point problems
• Accelerated Hermitian and skew-Hermitian splitting iteration methods for saddle-point problems
• Accelerated SOR-like method for augmented linear systems
• Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems
• Block Triangular and Skew-Hermitian Splitting Methods for Positive-Definite Linear Systems
• Conjugate gradient method for rank deficient saddle point problems
• Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
• Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
• Minimum residual methods for augmented systems
• Mixed and Hybrid Finite Element Methods
• Modified accelerated parameterized inexact Uzawa method for singular and nonsingular saddle point problems
• Modified parameterized inexact Uzawa method for singular saddle-point problems
• Motivations and realizations of Krylov subspace methods for large sparse linear systems
• Numerical solution of saddle point problems
• On choices of iteration parameter in HSS method
• On generalized successive overrelaxation methods for augmented linear systems
• On inexact Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems
• On parameterized inexact Uzawa methods for generalized saddle point problems
• On semi-convergence of Hermitian and skew-Hermitian splitting methods for singular linear systems
• On semi-convergence of ULT iterative method for the singular saddle point problems
• On semi-convergence of parameterized Uzawa methods for singular saddle point problems
• On semi-convergence of the Uzawa-HSS method for singular saddle-point problems
• On semi-convergence of the generalized shift-splitting iteration method for singular nonsymmetric saddle point problems
• PU-STS method for non-Hermitian saddle-point problems
• Performance and analysis of saddle point preconditioners for the discrete steady-state Navier-Stokes equations
• Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hemitian positive semidefinite linear systems
• SOR-like methods for augmented systems
• Semi-convergence analysis of Uzawa methods for singular saddle point problems
• Sharp error bounds of some Krylov subspace methods for non-Hermitian linear systems
• Shift-splitting preconditioners for saddle point problems
• Structured preconditioners for nonsingular matrices of block two-by-two structures
• The Numerical Solution of Equality-Constrained Quadratic Programming Problems
• The corrected Uzawa method for solving saddle point problems.
• The generalized modified shift-splitting preconditioners for nonsymmetric saddle point problems
• The modified shift-splitting preconditioners for nonsymmetric saddle-point problems

Cited in

(18)

• A shift-splitting preconditioner for asymmetric saddle point problems
• Efficient block splitting iteration methods for solving a class of complex symmetric linear systems
• Parameterized generalized shift-splitting preconditioners for nonsymmetric saddle point problems
• The generalized modified shift-splitting preconditioners for nonsymmetric saddle point problems
• An efficient preconditioned variant of the PSS preconditioner for generalized saddle point problems
• The modified shift-splitting preconditioners for nonsymmetric saddle-point problems
• Shift-splitting iteration method and its variants for solving continuous Sylvester equations
• The modified Assor-like method for saddle point problems
• A modified parameterized shift-splitting preconditioner for saddle point problems
• The improvements of the generalized shift-splitting preconditioners for non-singular and singular saddle point problems
• A accelerated modified shift-splitting method for nonsymmetric saddle point problems
• Spectral analysis of the MGSS preconditioner for singular saddle point problems
• Modified PHSS iterative methods for solving nonsingular and singular saddle point problems
• New modified shift-splitting preconditioners for non-symmetric saddle point problems
• A two-parameter shift-splitting preconditioner for saddle point problems
• A modified shift-splitting method for nonsymmetric saddle point problems
• A modified generalized shift-splitting method for nonsymmetric saddle point problems
• Regularized preconditioned GMRES and the regularized iteration method

This page was built for publication: A modified generalized shift-splitting preconditioner for nonsymmetric saddle point problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751070)