<div><p>ABSTRACT We discuss the parallel implementation of a two-level algebraic ILU(k)-based domain decomposition preconditioner using the PETSc library. We present strategies to improve performance and minimize communication among processes during setup and application phases. We compare our implementation with an off-the-shelf preconditioner in PETSc for solving linear systems arising in reservoir simulation problems, and show that for some cases our implementation performs better.</p></div
Introduction In recent years, domain decomposition methods have been used extensively to efficiently...
Domain decomposition methods are, alongside multigrid methods, one of the dominant paradigms in cont...
Incomplete factorization preconditioners such as ILU, ILUT and MILU are well-known robust general-pu...
We outline the design principles underlying the ParPre library of parallel preconditioners. ParPre i...
Solving large sparse linear systems is a time-consuming step in basin modeling or reservoir simulati...
We consider a new element-by-element algebraic multilevel block-ILU preconditioner for linear system...
We present a package of parallel preconditioners which implements one-level and two-level Domain Dec...
We report the development of a parallel algorithm for computing ILU preconditioners. The algorithm a...
Abstract. In this work we study the behavior of Block ILU preconditioners in distribuited-memory par...
International audienceThis paper details the software implementation of the ARAS preconditioning tec...
A popular class of preconditioners is known as incomplete factorizations. They can be thought of as ...
In this paper, the efficiency of a parallelizable preconditioner for domain decomposition methodsin ...
Incomplete factorization preconditioners such as ILU, ILUT and MILU are well-known robust general-pu...
Domain decomposition ideas have long been an essential tool for the solution of PDEs on parallel com...
AbstractWe propose a new preconditioner DASP (discrete approximate spectral preconditioner), based o...
Introduction In recent years, domain decomposition methods have been used extensively to efficiently...
Domain decomposition methods are, alongside multigrid methods, one of the dominant paradigms in cont...
Incomplete factorization preconditioners such as ILU, ILUT and MILU are well-known robust general-pu...
We outline the design principles underlying the ParPre library of parallel preconditioners. ParPre i...
Solving large sparse linear systems is a time-consuming step in basin modeling or reservoir simulati...
We consider a new element-by-element algebraic multilevel block-ILU preconditioner for linear system...
We present a package of parallel preconditioners which implements one-level and two-level Domain Dec...
We report the development of a parallel algorithm for computing ILU preconditioners. The algorithm a...
Abstract. In this work we study the behavior of Block ILU preconditioners in distribuited-memory par...
International audienceThis paper details the software implementation of the ARAS preconditioning tec...
A popular class of preconditioners is known as incomplete factorizations. They can be thought of as ...
In this paper, the efficiency of a parallelizable preconditioner for domain decomposition methodsin ...
Incomplete factorization preconditioners such as ILU, ILUT and MILU are well-known robust general-pu...
Domain decomposition ideas have long been an essential tool for the solution of PDEs on parallel com...
AbstractWe propose a new preconditioner DASP (discrete approximate spectral preconditioner), based o...
Introduction In recent years, domain decomposition methods have been used extensively to efficiently...
Domain decomposition methods are, alongside multigrid methods, one of the dominant paradigms in cont...
Incomplete factorization preconditioners such as ILU, ILUT and MILU are well-known robust general-pu...