Sparse

Dynamic Scheduling for sparse direct Solver on NUMA architectures

Over the past few years, parallel sparse direct solvers made significant progress and are now able to efficiently work on problems with several millions of equations. This paper presents some improvements on our sparse direct solver PaStiX1 for …

On finding approximate supernodes for an efficient ILU(k) factorization

Among existing preconditioners, the level-of-fill ILU has been quite popular as a general-purpose technique. Experimental observations have shown that, when coupled with block techniques, these methods can be quite effective in solving realistic …

A supernode amalgamation algorithm for an efficient block incomplete factorization

High performances methods for solving large sparse linear systems - Direct and Incomplete Factorization

Optimisation des performances des outils de calcul de neutronique des coeurs

On finding approximate supernodes for an efficient ILU(k) factorization

Partitioning and Blocking Issues for a Parallel Incomplete Factorization

The purpose of this work is to provide a method which exploits the parallel block-wise algorithmic approach used in the framework of high performance sparse direct solvers in order to develop robust and efficient preconditioners based on a parallel …

A Parallel Multilevel ILU Factorization based on a Hierarchical Graph Decomposition

On using an hybrid MPI-Thread programming for the implementation of a parallel sparse direct solver on a network of SMP nodes

Since the last decade, most of the supercomputer architectures are based on cluster of SMP nodes. In those architectures the exchanges between processors are made through shared memory when the processor are located on a same SMP node and through …

Blocking Issues for an Efficient Parallel Block ILU Preconditioner