In this paper we consider the problem of preconditioning symmetric positive definite matrices of the form (A)\u3b1 = A + \u3b1I where \u3b1 > 0. We discuss how to cheaply modify an existing sparse approximate inverse preconditioner for A in order to obtain a preconditioner for A\u3b1. Numerical experiments illustrating the performance of the proposed approaches are presented
The class of preconditioning that approximates the inverse of the matrix A is studied in the thesis....
We focus on inverse preconditioners based on minimizing F ( X ) = 1 − cos ( X A , I ) , where...
Abstract. We introduce a novel strategy for constructing symmetric positive definite (SPD) precondit...
In this paper we consider the problem of preconditioning symmetric positive definite matrices of th...
We present a technique for building effective and low cost preconditioners for sequences of shifted ...
We present a technique for building effective and low cost preconditioners for sequences of shifted ...
This paper is concerned with a new approach to preconditioning for large, sparse linear systems. A p...
Abstract. Motivated by the paper [16], where the authors proposed a method to solve a symmet-ric pos...
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...
. This paper is concerned with a new approach to preconditioning for large, sparse linear systems. A...
A novel parallel preconditioner for symmetric positive definite matrices is developed coupling a gen...
The efficient solution to non-symmetric linear systems is still an open issue on parallel computers....
. A method for computing a sparse incomplete factorization of the inverse of a symmetric positive de...
We propose a class of preconditioners for large positive definite linear systems, arising in nonlin...
The class of preconditioning that approximates the inverse of the matrix A is studied in the thesis....
We focus on inverse preconditioners based on minimizing F ( X ) = 1 − cos ( X A , I ) , where...
Abstract. We introduce a novel strategy for constructing symmetric positive definite (SPD) precondit...
In this paper we consider the problem of preconditioning symmetric positive definite matrices of th...
We present a technique for building effective and low cost preconditioners for sequences of shifted ...
We present a technique for building effective and low cost preconditioners for sequences of shifted ...
This paper is concerned with a new approach to preconditioning for large, sparse linear systems. A p...
Abstract. Motivated by the paper [16], where the authors proposed a method to solve a symmet-ric pos...
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...
. This paper is concerned with a new approach to preconditioning for large, sparse linear systems. A...
A novel parallel preconditioner for symmetric positive definite matrices is developed coupling a gen...
The efficient solution to non-symmetric linear systems is still an open issue on parallel computers....
. A method for computing a sparse incomplete factorization of the inverse of a symmetric positive de...
We propose a class of preconditioners for large positive definite linear systems, arising in nonlin...
The class of preconditioning that approximates the inverse of the matrix A is studied in the thesis....
We focus on inverse preconditioners based on minimizing F ( X ) = 1 − cos ( X A , I ) , where...
Abstract. We introduce a novel strategy for constructing symmetric positive definite (SPD) precondit...