We present a variant of the AINV factorized sparse approximate inverse algorithm which is applicable to any symmetric positive definite matrix. The new preconditioner is breakdown-free and, when used in conjunction with the conjugate gradient method, results in a reliable solver for highly ill-conditioned linear systems. We also investigate an alternative approach to a stable approximate inverse algorithm, based on the idea of diagonally compensated reduction of matrix entries. The results of numerical tests on challenging linear systems arising from finite element modeling of elasticity and diffusion problems are presented
This paper deals with background and practical experience with preconditioned gradient methods for s...
A sparse approximate inverse technique is introduced to solve general sparse linear systems. The spa...
This paper presents a systematic approach to robust preconditioning for gradient-based nonlinear inv...
We present a variant of the AINV factorized sparse approximate inverse algorithm which is applicable...
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...
. This paper is concerned with a new approach to preconditioning for large, sparse linear systems. A...
Some new developments of conjugation-based sparse approximate inverse preconditioners are considered...
The solution of linear systems arising in the finite element analysis of shells and solids by the pr...
A new class of approximate inverse preconditioners for large finite element stiffness ma-trices aris...
AbstractThis paper introduces a new preconditioner with a super convergence for the conjugate gradie...
Abstract. Block preconditionings for the conjugate gradient method are investigated for solving posi...
The efficient parallel solution to large sparse linear systems of equations Ax = b is a central issu...
A new class of normalized explicit approximate inverse matrix techniques, based on normalized approx...
This paper deals with background and practical experience with preconditioned gradient methods for s...
A sparse approximate inverse technique is introduced to solve general sparse linear systems. The spa...
This paper presents a systematic approach to robust preconditioning for gradient-based nonlinear inv...
We present a variant of the AINV factorized sparse approximate inverse algorithm which is applicable...
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...
. This paper is concerned with a new approach to preconditioning for large, sparse linear systems. A...
Some new developments of conjugation-based sparse approximate inverse preconditioners are considered...
The solution of linear systems arising in the finite element analysis of shells and solids by the pr...
A new class of approximate inverse preconditioners for large finite element stiffness ma-trices aris...
AbstractThis paper introduces a new preconditioner with a super convergence for the conjugate gradie...
Abstract. Block preconditionings for the conjugate gradient method are investigated for solving posi...
The efficient parallel solution to large sparse linear systems of equations Ax = b is a central issu...
A new class of normalized explicit approximate inverse matrix techniques, based on normalized approx...
This paper deals with background and practical experience with preconditioned gradient methods for s...
A sparse approximate inverse technique is introduced to solve general sparse linear systems. The spa...
This paper presents a systematic approach to robust preconditioning for gradient-based nonlinear inv...