AbstractFor large sparse saddle point problems, Chen and Jiang recently studied a class of generalized inexact parameterized iterative methods (see [F. Chen, Y.-L. Jiang, A generalization of the inexact parameterized Uzawa methods for saddle point problems, Appl. Math. Comput. 206 (2008) 765–771]). In this paper, the methods are modified and some choices of preconditioning matrices are given. These preconditioning matrices have advantages in solving large sparse linear system. Numerical experiments of a model Stokes problem are presented
We propose a class of regularized Hermitian and skew-Hermitian splitting methods for the solution of...
We investigate the solution of linear systems of saddle point type with an indefinite (1, 1) block b...
The efficiency of several preconditioned Conjugate Gradient (PCG) schemes for solving of large spars...
AbstractFor large sparse saddle point problems, Chen and Jiang recently studied a class of generaliz...
AbstractFor the large sparse saddle point problems, Bai et al. recently studied a class of parameter...
AbstractA parameterized preconditioning framework is proposed to improve the conditions of the gener...
Iterative methods are currently the solvers of choice for large sparse linear systems of equations. ...
This book describes, in a basic way, the most useful and effective iterative solvers and appropriate...
AbstractThe parameterized Uzawa preconditioners for saddle point problems are studied in this paper....
Iterative subspace projection methods are the most widely used methods for solving large sparse line...
This article surveys preconditioning techniques for the iterative solution of large linear systems, ...
AbstractBased on the block-triangular product approximation to a 2-by-2 block matrix, a class of hyb...
In this paper, we propose an inexact Uzawa method with variable relaxation parameters for iterativel...
AbstractBased on matrix splittings, a new alternating preconditioner with two parameters is proposed...
122 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.For these applications, we pr...
We propose a class of regularized Hermitian and skew-Hermitian splitting methods for the solution of...
We investigate the solution of linear systems of saddle point type with an indefinite (1, 1) block b...
The efficiency of several preconditioned Conjugate Gradient (PCG) schemes for solving of large spars...
AbstractFor large sparse saddle point problems, Chen and Jiang recently studied a class of generaliz...
AbstractFor the large sparse saddle point problems, Bai et al. recently studied a class of parameter...
AbstractA parameterized preconditioning framework is proposed to improve the conditions of the gener...
Iterative methods are currently the solvers of choice for large sparse linear systems of equations. ...
This book describes, in a basic way, the most useful and effective iterative solvers and appropriate...
AbstractThe parameterized Uzawa preconditioners for saddle point problems are studied in this paper....
Iterative subspace projection methods are the most widely used methods for solving large sparse line...
This article surveys preconditioning techniques for the iterative solution of large linear systems, ...
AbstractBased on the block-triangular product approximation to a 2-by-2 block matrix, a class of hyb...
In this paper, we propose an inexact Uzawa method with variable relaxation parameters for iterativel...
AbstractBased on matrix splittings, a new alternating preconditioner with two parameters is proposed...
122 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.For these applications, we pr...
We propose a class of regularized Hermitian and skew-Hermitian splitting methods for the solution of...
We investigate the solution of linear systems of saddle point type with an indefinite (1, 1) block b...
The efficiency of several preconditioned Conjugate Gradient (PCG) schemes for solving of large spars...