Thesis

Improving the memory and time overhead of low-rank parallel linear sparse direct solvers

Through the recent improvements toward exascale supercomputer systems, huge computations can be performed in reasonable times by using massively parallelized operations. …

esragul-korkmaz

On the use of low-rank arithmetic to reduce the complexity of parallel sparse linear solvers based on direct factorization techniques

Solving sparse linear systems is a problem that arises in many scientific applications, and sparse direct solvers are a time consuming and key kernel for those applications and …

gregoire-pichon

Heterogeneous architectures, Hybrid methods, Hierarchical matrices for Sparse Linear Solvers

Add the full text or supplementary notes for the publication here using Markdown formatting.

p.-ramet

Optimizations of hybrid sparse linear solvers relying on Schur complement and domain decomposition approaches

In this thesis, we focus on the parallel solving of large sparse linear systems. Our main interest is on direct-iterative hybrid solvers such as HIPS, MAPHYS, PDSLIN or SHYLU, …

a.-casadei

Scheduling and memory optimizations for sparse direct solver on multi-core/multi-gpu duster systems

The ongoing hardware evolution exhibits an escalation in the number, as well as in the heterogeneity, of computing resources. The pressure to maintain reasonable levels of …

x.-lacoste

Domain decomposition method for the Simplified Transport Equation in neutronic

The reactivity computations are an essential component for the simulation of the core of a nuclear plant. These computations lead to generalized eigenvalue problems solved by the …

b.-lathuiliere

Static-Dynamic Hybrid Scheduling in sparse linear algebra for large clusters of NUMA and multi-cores architectures

New supercomputers incorporate many microprocessors which include themselves one or many computational cores. These new architectures induce strongly hierarchical topologies. These …

m.-faverge

Design of a parallel hybrid direct/iterative sparse linear solver

This thesis presents a parallel resolution method for sparse linear systems which combines effectively techniques of direct and iterative solvers using a Schur complement approach. …

j.-gaidamour

Distribution des Données et Rǵulation Statique des Calculs et des Communications pour la R'ólution de Grands Systèmes Lin'eŕes Creux par M'etd́e Directe

Solving large sparse symmetric positive definite systems of linear equations is a crucial and time-consuming step, arising in many scientific and engineering applications. In this …

p.-henon