DeepAI AI Chat
Log In Sign Up

A shift-splitting preconditioner for asymmetric saddle point problems

05/01/2020
by   Shi-Liang Wu, et al.
0

In this paper, we execute the shift-splitting preconditioner for asymmetric saddle point problems with its (1,2) block's transposition unequal to its (2,1) block under the removed minus of its (2,1) block. The proposed preconditioner is stemmed from the shift splitting (SS) iteration method for solving asymmetric saddle point problems, which is convergent under suitable conditions. The relaxed version of the shift-splitting preconditioner is obtained as well. The spectral distributions of the related preconditioned matrices are given. Numerical experiments from the Stokes problem are offered to show the convergence performance of these two preconditioners.

READ FULL TEXT

page 1

page 2

page 3

page 4

01/27/2022

A block triangular preconditioner for a class of three-by-three block saddle point problems

This paper deals with solving a class of three-by-three block saddle poi...
09/27/2021

HSS(0): an Improved Hermitian/Skew-Hermitian Splitting Iteration

We propose an improved version of the Hermitian/skew-Hermitian splitting...
12/26/2022

A stochastic preconditioned Douglas-Rachford splitting method for saddle-point problems

In this article, we propose and study a stochastic preconditioned Dougla...
08/16/2022

On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems

We consider the generalized successive overrelaxation (GSOR) method for ...
08/01/2022

Semi-convergence of the APSS method for a class of nonsymmetric three-by-three singular saddle point problems

For nonsymmetric block three-by-three singular saddle point problems ari...
12/04/2021

On the stability and performance of the solution of sparse linear systems by partitioned procedures

In this paper, we present, evaluate and analyse the performance of paral...