scholarly journals New modified shift-splitting preconditioners for non-symmetric saddle point problems

2019 ◽  
Vol 9 (2) ◽  
pp. 245-257
Author(s):  
Mahin Ardeshiry ◽  
Hossein Sadeghi Goughery ◽  
Hossein Noormohammadi Pour

Abstract Zhou et al. and Huang et al. have proposed the modified shift-splitting (MSS) preconditioner and the generalized modified shift-splitting (GMSS) for non-symmetric saddle point problems, respectively. They have used symmetric positive definite and skew-symmetric splitting of the (1, 1)-block in a saddle point problem. In this paper, we use positive definite and skew-symmetric splitting instead and present new modified shift-splitting (NMSS) method for solving large sparse linear systems in saddle point form with a dominant positive definite part in (1, 1)-block. We investigate the convergence and semi-convergence properties of this method for nonsingular and singular saddle point problems. We also use the NMSS method as a preconditioner for GMRES method. The numerical results show that if the (1, 1)-block has a positive definite dominant part, the NMSS-preconditioned GMRES method can cause better performance results compared to other preconditioned GMRES methods such as GMSS, MSS, Uzawa-HSS and PU-STS. Meanwhile, the NMSS preconditioner is made for non-symmetric saddle point problems with symmetric and non-symmetric (1, 1)-blocks.

2021 ◽  
pp. 128-128
Author(s):  
Jun-Feng Lu

This paper proposes a hybrid iteration method for solving symmetric saddle point problem arising in computational fluid dynamics. It is an implicit alternative direction iteration method and named as the ULT-HSS method. The convergence analysis is provided, and the necessary and sufficient conditions are given for the convergence of the method. Some practical approaches are formulated for setting the optimal parameter of the method. Numerical experiments are given to show its efficiency.


2014 ◽  
Vol 2014 ◽  
pp. 1-5
Author(s):  
Qun-Fa Cui ◽  
Cui-Xia Li ◽  
Shi-Liang Wu

We discuss spectral properties of the iteration matrix of the HSS method for saddle point problems and derive estimates for the region containing both the nonreal and real eigenvalues of the iteration matrix of the HSS method for saddle point problems.


2017 ◽  
Vol 10 (1) ◽  
pp. 167-185 ◽  
Author(s):  
H. Noormohammadi Pour ◽  
H. Sadeghi Goughery

AbstractWe generalize the accelerated Hermitian and skew-Hermitian splitting (AHSS) iteration methods for large sparse saddle-point problems. These methods involve four iteration parameters whose special choices can recover the preconditioned HSS and accelerated HSS iteration methods. Also a new efficient case is introduced and we theoretically prove that this new method converges to the unique solution of the saddle-point problem. Numerical experiments are used to further examine the effectiveness and robustness of iterations.


PAMM ◽  
2021 ◽  
Vol 20 (1) ◽  
Author(s):  
Ritukesh Bharali ◽  
Fredrik Larsson ◽  
Ralf Jänicke

2020 ◽  
Vol 60 (11) ◽  
pp. 1787-1809
Author(s):  
M. S. Alkousa ◽  
A. V. Gasnikov ◽  
D. M. Dvinskikh ◽  
D. A. Kovalev ◽  
F. S. Stonyakin

2013 ◽  
Vol 46 (3) ◽  
Author(s):  
Alicja Smoktunowicz ◽  
Felicja Okulicka-Dłużewska

AbstractNumerical stability of two main direct methods for solving the symmetric saddle point problem are analyzed. The first one is a generalization of Golub’s method for the augmented system formulation (ASF) and uses the Householder QR decomposition. The second method is supported by the singular value decomposition (SVD). Numerical comparison of some direct methods are given.


Sign in / Sign up

Export Citation Format

Share Document