International audienceWe propose to use a randomization technique based on Random Butterfly Transformations (RBT) in the Algebraic Recursive Multilevel Solver (ARMS) to improve the preconditioning phase in the iterative solution of sparse linear systems. We integrated the RBT technique into the parallel version of ARMS (pARMS). The preliminary experimental results on some matrices from the Davis' collection show an improvement of the convergence and accuracy of the results when compared with existing implementations of the pARMS preconditioner
In this paper we introduce LORASC, a robust algebraic preconditioner for solving sparse linear syste...
Iterative methods are currently the solvers of choice for large sparse linear systems of equations. ...
International audienceWe illustrate how the distributed parallel Algebraic Recursive Multilevel Solv...
International audienceWe propose to use a randomization technique based on Random Butterfly Transfor...
In this paper, we introduce a class of recursive multilevel preconditioning strategies suited for so...
In this PhD thesis, we address three challenges faced by linear algebra solvers in the perspective o...
The recursive construction of Schur-complements is used to construct a multi-level preconditioner fo...
We present a preconditioning method for the iterative solution of large sparse systems of equations....
In this paper we introduce an algebraic recursive multilevel incomplete factorization preconditioner...
We introduce an algebraic recursive multilevel approximate inverse-based preconditioner, based on a ...
The recently developed Parallel Algebraic Recursive Multilevel Solver (pARMS) is the subject of this...
International audienceWe consider the solution of sparse linear systems using direct methods via LU ...
Our weakly random additive preconditioners facilitate the solution of linear systems of equa-tions a...
. For a sparse linear system Ax = b, preconditioners of the form C = D + L + U , where D is the blo...
In this paper we introduce LORASC, a robust algebraic preconditioner for solving sparse linear syste...
Iterative methods are currently the solvers of choice for large sparse linear systems of equations. ...
International audienceWe illustrate how the distributed parallel Algebraic Recursive Multilevel Solv...
International audienceWe propose to use a randomization technique based on Random Butterfly Transfor...
In this paper, we introduce a class of recursive multilevel preconditioning strategies suited for so...
In this PhD thesis, we address three challenges faced by linear algebra solvers in the perspective o...
The recursive construction of Schur-complements is used to construct a multi-level preconditioner fo...
We present a preconditioning method for the iterative solution of large sparse systems of equations....
In this paper we introduce an algebraic recursive multilevel incomplete factorization preconditioner...
We introduce an algebraic recursive multilevel approximate inverse-based preconditioner, based on a ...
The recently developed Parallel Algebraic Recursive Multilevel Solver (pARMS) is the subject of this...
International audienceWe consider the solution of sparse linear systems using direct methods via LU ...
Our weakly random additive preconditioners facilitate the solution of linear systems of equa-tions a...
. For a sparse linear system Ax = b, preconditioners of the form C = D + L + U , where D is the blo...
In this paper we introduce LORASC, a robust algebraic preconditioner for solving sparse linear syste...
Iterative methods are currently the solvers of choice for large sparse linear systems of equations. ...
International audienceWe illustrate how the distributed parallel Algebraic Recursive Multilevel Solv...