AbstractLinear systems of the form Ax = b, where the matrix A is symmetric and positive definite, often arise from the discretization of elliptic partial differential equations. A very successful method for solving these linear systems is the preconditioned conjugate gradient method. In this paper, we study parallel preconditioners for the conjugate gradient method based on the block two-stage iterative methods. Sufficient conditions for the validity of these preconditioners are given. Computational results of these preconditioned conjugate gradient methods on two parallel computing systems are presented
Iterative methods for solving large-scale linear systems have been gaining popularity in many areas ...
AbstractIn this paper we show how an algebraically reduced system can be constructed, for which the ...
We consider the problem of solving a symmetric, positive def-inite system of linear equations. The m...
AbstractLinear systems of the form Ax = b, where the matrix A is symmetric and positive definite, of...
This paper describes a preconditioned conjugate gradient method that can be effectively implemented ...
This report presents preconditioning techniques for the conjugate gradient method (CG), an iterative...
The block preconditioned conjugate gradient (BPCG) methods, even if very effective for solving the l...
The block preconditioned conjugate gradient (BPCG) methods, even if very effective for solving the l...
This report presents preconditioning techniques for the conjugate gradient method (CG), an iterative...
The block preconditioned conjugate gradient (BPCG) methods, even if very effective for solving the l...
AbstractThis paper discusses preconditioners for the Conjugate Gradient Method which are based on sp...
In this report we consider two parallel additive preconditioners for solving block tridiagonal linea...
AbstractThe restrictively preconditioned conjugate gradient (RPCG) method for solving large sparse s...
In this report we consider two parallel additive preconditioners for solving block tridiagonal linea...
Preconditioned conjugate gradient methods for solving sparse symmetric and positive finite systems o...
Iterative methods for solving large-scale linear systems have been gaining popularity in many areas ...
AbstractIn this paper we show how an algebraically reduced system can be constructed, for which the ...
We consider the problem of solving a symmetric, positive def-inite system of linear equations. The m...
AbstractLinear systems of the form Ax = b, where the matrix A is symmetric and positive definite, of...
This paper describes a preconditioned conjugate gradient method that can be effectively implemented ...
This report presents preconditioning techniques for the conjugate gradient method (CG), an iterative...
The block preconditioned conjugate gradient (BPCG) methods, even if very effective for solving the l...
The block preconditioned conjugate gradient (BPCG) methods, even if very effective for solving the l...
This report presents preconditioning techniques for the conjugate gradient method (CG), an iterative...
The block preconditioned conjugate gradient (BPCG) methods, even if very effective for solving the l...
AbstractThis paper discusses preconditioners for the Conjugate Gradient Method which are based on sp...
In this report we consider two parallel additive preconditioners for solving block tridiagonal linea...
AbstractThe restrictively preconditioned conjugate gradient (RPCG) method for solving large sparse s...
In this report we consider two parallel additive preconditioners for solving block tridiagonal linea...
Preconditioned conjugate gradient methods for solving sparse symmetric and positive finite systems o...
Iterative methods for solving large-scale linear systems have been gaining popularity in many areas ...
AbstractIn this paper we show how an algebraically reduced system can be constructed, for which the ...
We consider the problem of solving a symmetric, positive def-inite system of linear equations. The m...