Related papers: General constraint preconditioning iteration metho…
We establish a new iterative method for solving a class of large and sparse linear systems of equations with three-by-three block coefficient matrices having saddle point structure. Convergence properties of the proposed method are studied…
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…
A modification of the generalized shift-splitting (GSS) method is presented for solving singular saddle point problems. In this kind of modification, the diagonal shift matrix is replaced by a block diagonal matrix which is symmetric…
This paper introduces a preconditioned method designed to comprehensively address the saddle point system with the aim of improving convergence efficiency. In the preprocessor construction phase, a technical approach for solving the…
In this paper, the generalized shift-splitting preconditioner is implemented for saddle point problems with symmetric positive definite (1,1)-block and symmetric positive semidefinite (2,2)-block. The proposed preconditioner is extracted…
In this paper, we propose a preconditioner based on the shift-splitting method for generalized saddle point problems with nonsymmetric positive definite (1,1)-block and symmetric positive semidefinite $(2,2)$-block. The proposed…
Recently, Krukier et al. [Generalized skew-Hermitian triangular splitting iteration methods for saddle-point linear systems, Numer. Linear Algebra Appl. 21 (2014) 152-170] proposed an efficient generalized skew-Hermitian triangular…
This work is concerned with the convergence of the iterative solution for the Stokes flow, discretized with the weak Galerkin finite element method and preconditioned using inexact block Schur complement preconditioning. The resulting…
Recently, in (M. Masoudi, D.K. Salkuyeh, An extension of positive-definite and skew-Hermitian splitting method for preconditioning of generalized saddle point problems, Computers \& Mathematics with Application,…
For nonsymmetric block three-by-three singular saddle point problems arising from the Picard iteration method for a class of mixed finite element scheme, recently Salkuyeh et al. in (D.K. Salkuyeh, H. Aslani, Z.Z. Liang, An alternating…
We consider the generalized successive overrelaxation (GSOR) method for solving a class of block three-by-three saddle-point problems. Based on the necessary and sufficient conditions for all roots of a real cubic polynomial to have modulus…
We have presented a fast method for solving a specific type of block four-by-four saddlepoint problem arising from the finite element discretization of the generalized 3D Stokes problem. We analyze the eigenvalue distribution and the…
In this paper, we propose a generalized shift-splitting (GSS) preconditioner, along with its two relaxed variants to solve the double saddle point problem (DSPP). The convergence of the associated GSS iterative method is analyzed, and…
We consider symmetric positive definite preconditioners for multiple saddle-point systems of block tridiagonal form, which can be applied within the MINRES algorithm. We describe such a preconditioner for which the preconditioned matrix has…
In this paper, we describe and analyze the spectral properties of a number of exact block preconditioners for a class of double saddle point problems. Among all these, we consider an inexact version of a block triangular preconditioner…
We consider the solution of saddle-point systems with a tree-based block structure, introducing a parallelizable direct method for their solution. As our key contribution, we then propose several structure-exploiting preconditioners to be…
The saddle-point problems (SPPs) with nonlinear coupling operators frequently arise in various control systems, such as dynamic programming optimization, H-infinity control, and Lyapunov stability analysis. However, traditional primal-dual…
In this manuscript, we present a collective multigrid algorithm to solve efficiently the large saddle-point systems of equations that typically arise in PDE-constrained optimization under uncertainty, and develop a novel convergence…
We consider the iterative solution of regularized saddle-point systems. When the leading block is symmetric and positive semi-definite on an appropriate subspace, Dollar, Gould, Schilders, and Wathen (2006) describe how to apply the…
This paper introduces inexact versions of several block-splitting preconditioners for solving the three-by-three block linear systems arising from a special class of indefinite least squares problems. We first establish the convergence…