A method for computing a sparse incomplete factorization of the inverse of a symmetric positive definite matrix A is developed, and the resulting factored sparse approximate inverse is used as an explicit preconditioner for conjugate gradient calculations. It is proved that in exact arithmetic the preconditioner is well defined if A is an H-matrix. The results of numerical experiments are presented
In this paper we consider the problem of preconditioning symmetric positive definite matrices of the...
Incomplete LU factorization is a valuable preconditioning approach for sparse iterative solvers. An ...
The efficient parallel solution to large sparse linear systems of equations Ax = b is a central issu...
A method for computing a sparse incomplete factorization of the inverse of a symmetric positive defi...
. A method for computing a sparse incomplete factorization of the inverse of a symmetric positive de...
This paper is concerned with a new approach to preconditioning for large, sparse linear systems. A p...
We present a variant of the AINV factorized sparse approximate inverse algorithm which is applicable...
. This paper is concerned with a new approach to preconditioning for large, sparse linear systems. A...
A sparse approximate inverse technique is introduced to solve general sparse linear systems. The spa...
Abstract. Block preconditionings for the conjugate gradient method are investigated for solving posi...
AbstractThis paper introduces a new preconditioner with a super convergence for the conjugate gradie...
AbstractThe restrictively preconditioned conjugate gradient (RPCG) method for solving large sparse s...
We describe a novel technique for computing a sparse incomplete factorization of a general symmetric...
A number of recently proposed preconditioning techniques based on sparse approximate inverses are co...
Abstract: In the paper we consider the iterative solution of linear systemby the conjugate...
In this paper we consider the problem of preconditioning symmetric positive definite matrices of the...
Incomplete LU factorization is a valuable preconditioning approach for sparse iterative solvers. An ...
The efficient parallel solution to large sparse linear systems of equations Ax = b is a central issu...
A method for computing a sparse incomplete factorization of the inverse of a symmetric positive defi...
. A method for computing a sparse incomplete factorization of the inverse of a symmetric positive de...
This paper is concerned with a new approach to preconditioning for large, sparse linear systems. A p...
We present a variant of the AINV factorized sparse approximate inverse algorithm which is applicable...
. This paper is concerned with a new approach to preconditioning for large, sparse linear systems. A...
A sparse approximate inverse technique is introduced to solve general sparse linear systems. The spa...
Abstract. Block preconditionings for the conjugate gradient method are investigated for solving posi...
AbstractThis paper introduces a new preconditioner with a super convergence for the conjugate gradie...
AbstractThe restrictively preconditioned conjugate gradient (RPCG) method for solving large sparse s...
We describe a novel technique for computing a sparse incomplete factorization of a general symmetric...
A number of recently proposed preconditioning techniques based on sparse approximate inverses are co...
Abstract: In the paper we consider the iterative solution of linear systemby the conjugate...
In this paper we consider the problem of preconditioning symmetric positive definite matrices of the...
Incomplete LU factorization is a valuable preconditioning approach for sparse iterative solvers. An ...
The efficient parallel solution to large sparse linear systems of equations Ax = b is a central issu...