We present a technique for building effective and low cost preconditioners for sequences of shifted linear systems (A + αI) x_α = b, where A is symmetric positive definite and α > 0. This technique updates a preconditioner for A, available in the form of an LDL^T factorization, by modifying only the nonzero entries of the L factor in such a way that the resulting preconditioner mimics the diagonal of the shifted matrix and reproduces its overall behavior. This approach is supported by a theoretical analysis as well as by numerical experiments, showing that it works efficiently for a broad range of values of α
Abstract. The original TPABLO algorithms are a collection of algorithms which compute a symmetric pe...
Updating preconditioners for the solution of sequences of large and sparse saddle- point linear syst...
International audienceA new domain decomposition preconditioner is introduced for efficiently solvin...
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 ...
In this paper we consider the problem of preconditioning symmetric positive definite matrices of the...
We propose a framework for building preconditioners for sequences of linear systems of the form (A+Δ...
We propose a framework for building preconditioners for sequences of linear systems of the form $(A+...
Efficient solution of sequences of linear systems is a task arising in numerous applications in engi...
We consider the solution of sequences of linear systems A(i)x = b(i), i = 1,..., where A(i) ∈ Rn×n ...
A new strategy for updating preconditioners by polynomial interpolation of factors of approximate in...
After briefly recalling some relevant approaches for preconditioning large symmetric linear systems,...
After briefly recalling some relevant approaches for preconditioning large symmetric linear systems,...
AbstractThis paper presents a class of preconditioning techniques which exploit rational function ap...
We propose a class of preconditioners for symmetric linear systems arising from numerical analysis a...
Abstract. The original TPABLO algorithms are a collection of algorithms which compute a symmetric pe...
Updating preconditioners for the solution of sequences of large and sparse saddle- point linear syst...
International audienceA new domain decomposition preconditioner is introduced for efficiently solvin...
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 ...
In this paper we consider the problem of preconditioning symmetric positive definite matrices of the...
We propose a framework for building preconditioners for sequences of linear systems of the form (A+Δ...
We propose a framework for building preconditioners for sequences of linear systems of the form $(A+...
Efficient solution of sequences of linear systems is a task arising in numerous applications in engi...
We consider the solution of sequences of linear systems A(i)x = b(i), i = 1,..., where A(i) ∈ Rn×n ...
A new strategy for updating preconditioners by polynomial interpolation of factors of approximate in...
After briefly recalling some relevant approaches for preconditioning large symmetric linear systems,...
After briefly recalling some relevant approaches for preconditioning large symmetric linear systems,...
AbstractThis paper presents a class of preconditioning techniques which exploit rational function ap...
We propose a class of preconditioners for symmetric linear systems arising from numerical analysis a...
Abstract. The original TPABLO algorithms are a collection of algorithms which compute a symmetric pe...
Updating preconditioners for the solution of sequences of large and sparse saddle- point linear syst...
International audienceA new domain decomposition preconditioner is introduced for efficiently solvin...